Tractability of deadlock avoidance problem in automated manufacturing systems modeled with petri net

Nai Qi Wu; Meng Chu Zhou

doi:10.1109/ICSMC.2008.4811598

Tractability of deadlock avoidance problem in automated manufacturing systems modeled with petri net

Nai Qi Wu, Meng Chu Zhou

Electrical and Computer Engineering

Research output: Contribution to journal › Conference article › peer-review

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.

Original language	English (US)
Article number	4811598
Pages (from-to)	2081-2086
Number of pages	6
Journal	Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
DOIs	https://doi.org/10.1109/ICSMC.2008.4811598
State	Published - 2008
Event	2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008 - Singapore, Singapore Duration: Oct 12 2008 → Oct 15 2008

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering
Control and Systems Engineering
Human-Computer Interaction

Keywords

Automated manufacturing systems
Deadlock avoidance
Petri net

Access to Document

10.1109/ICSMC.2008.4811598

Cite this

@article{816f2f44b7164b59adf6335c44625982,

title = "Tractability of deadlock avoidance problem in automated manufacturing systems modeled with petri net",

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.",

keywords = "Automated manufacturing systems, Deadlock avoidance, Petri net",

author = "Wu, {Nai Qi} and Zhou, {Meng Chu}",

year = "2008",

doi = "10.1109/ICSMC.2008.4811598",

language = "English (US)",

pages = "2081--2086",

journal = "Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics",

issn = "1062-922X",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008 ; Conference date: 12-10-2008 Through 15-10-2008",

}

TY - JOUR

T1 - Tractability of deadlock avoidance problem in automated manufacturing systems modeled with petri net

AU - Wu, Nai Qi

AU - Zhou, Meng Chu

PY - 2008

Y1 - 2008

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

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

KW - Automated manufacturing systems

KW - Deadlock avoidance

KW - Petri net

UR - http://www.scopus.com/inward/record.url?scp=69949166603&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=69949166603&partnerID=8YFLogxK

U2 - 10.1109/ICSMC.2008.4811598

DO - 10.1109/ICSMC.2008.4811598

M3 - Conference article

AN - SCOPUS:69949166603

SN - 1062-922X

SP - 2081

EP - 2086

JO - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

JF - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

M1 - 4811598

T2 - 2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008

Y2 - 12 October 2008 through 15 October 2008

ER -

Tractability of deadlock avoidance problem in automated manufacturing systems modeled with petri net

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this