A divide-and-conquer strategy to deadlock prevention in flexible manufacturing systems
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Liveness enforcing supervision of video streaming systems using nonsequential Petri nets
IEEE Transactions on Multimedia
Comment on "on siphon computation for deadlock control in a class of Petri nets"
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Petri net modeling and deadlock analysis of parallel manufacturing processes with shared-resources
Journal of Systems and Software
Module-based architecture for a periodic job-shop scheduling problem
Computers & Mathematics with Applications
Analysis of the Petri net model of parallel manufacturing processes with shared resources
Information Sciences: an International Journal
Verification of problem-based learning systems using modified petri nets
Expert Systems with Applications: An International Journal
An algorithm to compute the minimal siphons in S4PR nets
Discrete Event Dynamic Systems
Design of Liveness-Enforcing Supervisors for S3PR Based on Complementary Places
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
One-Step Look-Ahead Maximally Permissive Deadlock Control of AMS by Using Petri Nets
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
Transition-Based Deadlock Detection and Recovery Policy for FMSs Using Graph Technique
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
| Hi-index | 0.00 |
As a structural object, siphons are well recognized in the analysis and control of deadlocks in resource allocation systems modeled with Petri nets. Many deadlock prevention policies characterize the deadlock behavior of the systems in terms of siphons and utilize this characterization to avoid deadlocks. This paper develops a novel methodology to find interesting siphons for deadlock control purposes in a class of Petri nets, i.e., a system of simple sequential processes with resources . Resource circuits in an are first detected, from which, in general, a small portion of emptiable minimal siphons can be derived. The remaining emptiable ones can be found by their composition. A polynomial-time algorithm for finding the set of elementary siphons is proposed, which avoids complete siphon enumeration. It is shown that a dependent siphon can always be controlled by properly supervising its elementary siphons. A computationally efficient deadlock control policy is accordingly developed. Experimental study shows the efficiency of the proposed siphon computation approach.