An Approach for Enumerating Minimal Siphons in a Subclass of Petri Nets

• Main Authors: Dan You, Shouguang Wang, Wenzhan Dai, Wenhui Wu, Yongshu Jia
• Format: Article
• Language: English
• Published: IEEE 2018-01-01
• Series: IEEE Access
• Subjects: Petri nets; S⁴PR nets; minimal siphon enumeration; problem partitioning
• Online Access: https://ieeexplore.ieee.org/document/8070302/
• ISSN: 2169-3536

Siphons, as a structural object of Petri nets (PNs), are closely related to deadlock-freedom in PNs. Efficient siphon computation is of great importance in developing siphon-based deadlock control strategies with good performance. This paper is concerned with the enumeration of minimal siphons in a subclass of PNs called systems of sequential systems with shared resources (S⁴PR). First, a method with polynomial complexity is proposed to decide whether a subset of resource places can generate a minimal siphon. Next, by utilizing the technique of problem partitioning, we develop an approach to compute all minimal siphons in S⁴PR. The proposed approach is illustrated by an example and its advantage is finally demonstrated via a comparison with other approaches.