Tractability of deadlock avoidance problem in automated manufacturing systems modeled with Petri Net

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 avoidanc...

Full description

Saved in:
Bibliographic Details
Published in2008 IEEE International Conference on Systems, Man and Cybernetics pp. 2081 - 2086
Main Authors Wu, NaiQi, Zhou, MengChu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2008
Subjects
automated manufacturing systems
Automatic control
Control systems
deadlock avoidance
Industrial engineering
Manufacturing systems
Petri net
Polynomials
Resource management
Robotics and automation
Space technology
Sufficient conditions
System recovery
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:142442383X
9781424423835
ISSN:1062-922X
2577-1655
DOI:10.1109/ICSMC.2008.4811598