Petri nets: an introduction
Concurrent and maximally concurrent evolution of nonsequential systems
Theoretical Computer Science
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Diamond properties of elementary net systems
Fundamenta Informaticae
Stubborn sets for reduced state generation
APN 90 Proceedings on Advances in Petri nets 1990
Using partial orders for the efficient verification of deadlock freedom and safety properties
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
Partial commutation and traces
Handbook of formal languages, vol. 3
Fundamenta Informaticae - Special issue on Petri nets
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
On Combining the Persistent Sets Method with the Covering Steps Graph Method
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Bounded Reachability Checking with Process Semantics
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Partial-Order Methods for Temporal Verification
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
Bounded LTL model checking with stable models
Theory and Practice of Logic Programming
Petri Nets for Systems Engineering: A Guide to Modeling, Verification, and Applications
Petri Nets for Systems Engineering: A Guide to Modeling, Verification, and Applications
Analysis of the Petri net model of parallel manufacturing processes with shared resources
Information Sciences: an International Journal
Hi-index | 0.00 |
A new partial order semantics called canonical transition set (CTS for short) semantics is proposed for P/T nets. We first prove that it is well-defined, sound and complete, and then give a state space exploring method based on it. CTS semantics provides a compressed representation for the interleaving transition sequences of finite length. Compared with other methods, the state space exploration based on CTS semantics can avoid many redundant branches and reach all states in less steps. Furthermore, we show that CTS semantics coincides with step semantics in Foata normal form [8] for pure 1-safe nets, which gives an experimental support that CTS semantics is more efficient for state space exploration. As for a special property, deadlock, we show that all deadlocks can be detected by a method combining CTS semantics with persistent set method.