Sciweavers

498 search results - page 19 / 100
» On the Category of Petri Net Computations
Sort
View
CONCUR
1999
Springer
14 years 22 days ago
An Unfolding Algorithm for Synchronous Products of Transition Systems
Abstract. The unfolding method, initially introduced for systems modelled by Petri nets, is applied to synchronous products of transition systems, a model introduced by Arnold [2]....
Javier Esparza, Stefan Römer
BIRTHDAY
2008
Springer
13 years 10 months ago
The Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and Reversed
The Scholten/Dijkstra "Pebble Game" is re-examined. We show that the algorithm lends itself to a distributed as well as an online version, and even to a reversed variant....
Wolfgang Reisig
JSS
1998
85views more  JSS 1998»
13 years 8 months ago
Comparative study and categorization of high-level petri nets
The graphical formalism of Petri Nets (PNs) is established on a strong mathematical foundation that can be applied in systems speci®cation, analysis and veri®cation. However, cl...
Vasilis C. Gerogiannis, Achilles Kameas, Panayioti...
CAV
2010
Springer
207views Hardware» more  CAV 2010»
14 years 11 days ago
Petruchio: From Dynamic Networks to Nets
We introduce Petruchio, a tool for computing Petri net translations of dynamic networks. To cater for unbounded architectures beyond the capabilities of existing implementations, t...
Roland Meyer, Tim Strazny
CONCUR
2000
Springer
14 years 24 days ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny