Petri nets: an introduction
A technique of state space search based on unfolding
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
Towards an Efficient Algorithm for Unfolding Petri Nets
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Autonomous Continuous P/T Systems
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Unifying Petri Nets, Advances in Petri Nets
Unfoldings: A Partial-Order Approach to Model Checking (Monographs in Theoretical Computer Science. An EATCS Series)
Discrete, Continuous, and Hybrid Petri Nets
Discrete, Continuous, and Hybrid Petri Nets
Generalised computation of behavioural profiles based on petri-net unfoldings
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Hi-index | 0.00 |
The unfolding is a useful partial-order based method for analysis and verification of the Petri net properties. This technique can cope well with the so-called state space explosion problem, especially for the Petri nets with a lot of concurrency. The paper formalizes the concept of the unfolding for bounded hybrid Petri nets and introduces the algorithm for its computing.