Sciweavers

498 search results - page 27 / 100
» On the Category of Petri Net Computations
Sort
View
FOSSACS
2009
Springer
14 years 3 months ago
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...
Parosh Aziz Abdulla, Richard Mayr
CAAP
1990
13 years 12 months ago
Petri Nets as Models of Linear Logic
The chief purpose of this paper is to appraise the feasibility of Girard’s linear logic as a specification language for parallel processes. To this end we propose an interpreta...
Uffe Engberg, Glynn Winskel
ENTCS
2006
180views more  ENTCS 2006»
13 years 8 months ago
Mobile Synchronizing Petri Nets: A Choreographic Approach for Coordination in Ubiquitous Systems
The term Ubiquitous Computing was coined by Mark Weiser almost two decades ago. Despite all the time that has passed since Weiser's vision, ubiquitous computing still has a l...
Fernando Rosa Velardo, Olga Marroquín Alons...
RECOMB
2005
Springer
14 years 8 months ago
The Pathalyzer: A Tool for Analysis of Signal Transduction Pathways
Abstract. The Pathalyzer is a program for analyzing large-scale signal transduction networks. Reactions and their substrates and products are represented as transitions and places ...
David L. Dill, Merrill Knapp, Pamela Gage, Carolyn...
CONCUR
2000
Springer
14 years 2 days ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko