A structure to decide reachability in Petri nets
Theoretical Computer Science
Free choice Petri nets
On Liveness and Controlled Siphons in Petri Nets
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets
Proceedings of the 13th International Conference on Application and Theory of Petri Nets
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Instantaneous Soundness Checking of Industrial Business Process Models
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Generating Petri net state spaces
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Applying CEGAR to the petri net state equation
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
New algorithms for deciding the siphon-trap property
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
| Hi-index | 0.00 |
One of the disablers of structural Petri net verification techniques is the lack of diagnosis information that is easily understandable. In this article, we improve this situation for a particular technique: the siphon and trap based verification of liveness in free-choice nets. Instead of the information "there is a siphon without included marked trap", we exhibit an execution path that leads from the initial marking to a marking m* and a set of transitions that mutually block each other and are thus dead at m*. The latter information can be much more easily comprehended by non-experts in Petri net theory. We provide experimental results suggesting that our method is competitive to related state space techniques.