A distributed verification approach for modular Petri nets
Proceedings of the 2007 Summer Computer Simulation Conference
An Incremental and Modular Technique for Checking LTL\X Properties of Petri Nets
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Modular state spaces for prioritised Petri Nets
FOCS'10 Proceedings of the 16th Monterey conference on Foundations of computer software: modeling, development, and verification of adaptive systems
Decomposing process mining problems using passages
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
A counterexample-based incremental and modular verification approach
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
Decomposing Petri nets for process mining: A generic approach
Distributed and Parallel Databases
Process Discovery and Conformance Checking Using Passages
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.00 |
This paper reviews a proposal for the modularanalysis of Petri nets and its applicability tofactory automation systems. It presents new algorithmsto harness this modular analysis in thedetermination of reachable states with specifiedpartial markings, to determine possible deadlocks,both global and local, and also liveness. Thesealgorithms have been implemented in a prototypetool which has then been used to solve a problem infactory automation which, even for relatively simpleconfigurations, can lead to state spaces beyondthe capabilities of many analysis tools.