Sciweavers

357 search results - page 4 / 72
» On the Model of Computation of Place Transition Petri Nets
Sort
View
FOSSACS
2009
Springer
14 years 2 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
CONCUR
2001
Springer
14 years 4 hour ago
On the Power of Labels in Transition Systems
Abstract. In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled tr...
Jirí Srba
CONCUR
2009
Springer
14 years 2 months ago
Encoding Asynchronous Interactions Using Open Petri Nets
Abstract. We present an encoding for (bound) processes of the asynchronous CCS with replication into open Petri nets: ordinary Petri nets equipped with a distinguished set of open ...
Paolo Baldan, Filippo Bonchi, Fabio Gadducci
ISSADS
2005
Springer
14 years 1 months ago
Model Fragmentation for Distributed Workflow Execution: A Petri Net Approach
Workflow is the key technology for business process automation, while distributed workflow is the solution to deal with the decentralized nature of workflow applications and the pe...
Wei Tan, Yushun Fan
JCSS
2010
111views more  JCSS 2010»
13 years 6 months ago
Reduction rules for reset/inhibitor nets
Abstract. Reset/inhibitor nets are Petri nets extended with reset arcs and inhibitor arcs. A reset arc allows a transition to remove all tokens from a certain place when the transi...
H. M. W. Verbeek, Moe Thandar Wynn, Wil M. P. van ...