Combined siphon and marking generation for deadlock prevention in Petri nets
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Emergency response workflow resource requirements modeling and analysis
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A divide-and-conquer strategy to deadlock prevention in flexible manufacturing systems
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A novel approach to scheduling of single-arm cluster tools with wafer revisiting
CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
Robustness of deadlock avoidance algorithms for sequential processes
Automatica (Journal of IFAC)
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
Information Sciences: an International Journal
Hi-index | 0.00 |
Concurrent competition for finite resources by multiple parts in flexible manufacturing systems (FMS) results in deadlock. This is an important issue to be addressed in the operation of the system. A Petri net model, called colored resource-oriented Petri net (CROPN), is developed in this paper. The concurrent resource contention and the important characteristics of the production processes necessary for deadlock control are well modeled by this model. Based on the developed model, necessary and sufficient conditions and an efficient control law are presented for deadlock-free operation in FMS. This control law is a policy of dynamic resource allocation. It determines when a resource can be allocated to which job to avoid deadlock. This control law allows as many active parts as possible to be in the system, while deadlock is totally avoided. This control law is easy to implement and can be embedded into the real-time scheduler. A simple example is used to illustrate the application of the approach