Faster Unfolding of General Petri Nets Based on Token Flows
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Unfolding Semantics of Petri Nets Based on Token Flows
Fundamenta Informaticae - Petri Nets 2008
On path dependent loss and switch crosstalk reduction in optical networks
Information Sciences: an International Journal
An algorithm for direct construction of complete merged processes
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
How much is worth to remember? a taxonomy based on petri nets unfoldings
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Petri nets with localities and testing
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Modeling dependencies and simultaneity in membrane system computations
Theoretical Computer Science
Unfolding Semantics of Petri Nets Based on Token Flows
Fundamenta Informaticae - Petri Nets 2008
Verification of petri nets with read arcs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Branching Processes of General Petri Nets
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
Hi-index | 0.00 |
Model checking based on Petri net unfoldings is an approach widely applied to cope with the state space explosion problem. In this paper, we propose a new condensed representation of a Petri net’s behaviour called merged processes, which copes well not only with concurrency, but also with other sources of state space explosion, viz sequences of choices and non-safeness. Moreover, this representation is sufficiently similar to the traditional unfoldings, so that a large body of results developed for the latter can be re-used. Experimental results indicate that the proposed representation of a Petri net’s behaviour alleviates the state space explosion problem to a significant degree and is suitable for model checking.