Computation of Minimal Siphons in Petri Nets by Using Binary Decision Diagrams

Authors:
Yufeng Chen;Gaiyun Liu
Affiliations:
Xidian University, China;Xidian University, China
Venue:
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
Year:
2013

Citing 15
Cited 0

Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Symbolic Analysis of Bounded Petri Nets

IEEE Transactions on Computers
Efficient Reachability Set Generation and Storage Using Decision Diagrams

Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Petri Net Analysis Using Boolean Manipulation

Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Deadlock Resolution in Automated Manufacturing Systems: A Novel Petri Net Approach

Deadlock Resolution in Automated Manufacturing Systems: A Novel Petri Net Approach
Local and global deadlock prevention policies for resource allocation systems using partially generated reachability graphs

Computers and Industrial Engineering
An effective algorithm to find elementary siphons in a class of Petri nets

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Combined siphon and marking generation for deadlock prevention in Petri nets

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Liveness enforcing supervision of video streaming systems using nonsequential Petri nets

IEEE Transactions on Multimedia
Elementary siphons of Petri nets and their application to deadlock prevention in flexible manufacturing systems

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Enumeration algorithms for minimal siphons in Petri nets based on place constraints

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Clarifications on the Definitions of Elementary Siphons in Petri Nets

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Siphon-Based Deadlock Prevention Policy for Flexible Manufacturing Systems

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Control of Elementary and Dependent Siphons in Petri Nets and Their Application

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Selective Siphon Control for Deadlock Prevention in Petri Nets

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

Abstract

Siphons play an important role in the development of deadlock control methods by using Petri nets. The number of siphons increases exponentially with respect to the size of a Petri net. This article presents a symbolic approach to the computation of minimal siphons in Petri nets by using binary decision diagrams (BDD). The siphons of a Petri net can be found via a set of logic conditions. The logic conditions are symbolically modeled by using Boolean algebras. The operations of Boolean algebras are implemented by BDD that are capable of representing large sets of siphons with small shared data structures. The proposed method first uses BDD to compute all siphons of a Petri net and then a binary relation is designed to extract all minimal siphons. Finally, by using a number of examples, the efficiency of the proposed method is verified through different-sized problems.