Combined siphon and marking generation for deadlock prevention in Petri nets
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Supervisor synthesis for enforcing a class of generalized mutual exclusion constraints on petri nets
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A new class of Petri nets for modeling and control of ratio-enforced resource allocation systems
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
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
A parameterized liveness and ratio-enforcing supervisor for a class of generalized Petri nets
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
A fair amount of research has shown the importance of siphons in the analysis and control of deadlocks in a variety of resource allocation systems by using a Petri net formalism. In this paper, siphons in a generalized Petri net are classified into elementary and dependent ones, as done for ordinary nets in our previous work. Conditions are derived under which a dependent siphon is controlled by properly supervising its elementary siphons, which indicates that the controllability of dependent siphons in an ordinary Petri net is a special case of that in a generalized one. The application of the controllability of dependent siphons is shown by considering the deadlock prevention problem for a class of resource allocation systems, namely, G-system that allows multiple resource acquisitions and flexible routings in a flexible manufacturing system with machining, assembly, and disassembly operations. We develop a monitor-based deadlock prevention policy that first adds monitors for elementary siphons only to a G-system plant model such that the resultant net system satisfies the maximal controlled-siphon property (maximal cs-property). Then, by linear programming, initial tokens in the additional monitors are decided such that liveness is enforced to the supervised system. Also, a simplified live marking relationship for a G-system between the initial tokens of the source places and those of the resource places is derived. Finally, the proposed deadlock prevention methods are illustrated by using an example.