Selected papers of the Second Workshop on Concurrency and compositionality
The synthesis problem of Petri nets
Acta Informatica
Deriving Petri Nets from Finite Transition Systems
IEEE Transactions on Computers
Polynomial Algorithms for the Synthesis of Bounded Nets
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Design of Liveness-Enforcing Supervisors for Flexible Manufacturing Systems Using Petri Nets
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
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
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.00 |
This paper presents an efficient method to obtain a maximally permissive deadlock prevention policy for a flexible manufacturing system based on theory of regions. The theory of regions policy can provides an optimal deadlock prevention controller which is based on the reachability graph. However, its disadvantage is the state explosion problem since all marking/transition-separation instances (MTSIs) have to be identified. For improving the shortcoming, this paper proposes a new concept of the crucial marking/transition-separation instances (CMTSIs). Experimental results indicate that the proposed control policy in this paper is more efficient than the closely related approaches in the literature.