Tractability of deadlock avoidance problem in automated manufacturing systems modeled with petri net
Document Type
Conference Proceeding
Publication Date
12-1-2008
Abstract
For deadlock avoidance in automated manufacturing systems (AMSs), it is desired that a deadlock control policy is maximally permissive. However, up to now, the tractability problem of deadlock avoidance in AMSs is still open. This paper conducts study on the tractability problem of deadlock avoidance for the general sequential resource allocation problem with each step requiring a single resource. An AMS is modeled by colored resource-oriented Petri net (CROPN). Based on the model, necessary and sufficient condition, under which the deadlock avoidance problem is tractable, is presented. At the same time, a one step look-ahead control policy is presented. © 2008 IEEE.
Identifier
69949166603 (Scopus)
Publication Title
Conference Proceedings IEEE International Conference on Systems Man and Cybernetics
External Full Text Location
https://doi.org/10.1109/ICSMC.2008.4811598
ISSN
1062922X
First Page
2081
Last Page
2086
Recommended Citation
Wu, Nai Qi and Zhou, Meng Chu, "Tractability of deadlock avoidance problem in automated manufacturing systems modeled with petri net" (2008). Faculty Publications. 12523.
https://digitalcommons.njit.edu/fac_pubs/12523
