Combined siphon and marking generation for deadlock prevention in Petri nets
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Efficient deadlock prevention in Petri nets through the generation of selected siphons
ACC'09 Proceedings of the 2009 conference on American Control Conference
An algorithm to compute the minimal siphons in S4PR nets
Discrete Event Dynamic Systems
A boolean model for enumerating minimal siphons and traps in petri nets
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Computation of Minimal Siphons in Petri Nets by Using Binary Decision Diagrams
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
| Hi-index | 0.00 |
The paper addresses the problem of enumerating minimal siphons in an ordinary Petri net. The algorithms developed in this work recursively use a problem partitioning procedure to reduce the original search problem to multiple simpler search subproblems. Each subproblem has specific additional place constraints with respect to the original problem. Some results on algorithm correctness, convergence, and computational complexity are provided, as well as an experimental evaluation of performance. The algorithms can be applied to enumerate minimal, place-minimal siphons, or even siphons that are minimal with respect to given subsets of places.