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

Nai Qi Wu, Meng Chu Zhou

Research output: Contribution to journalConference articlepeer-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 languageEnglish (US)
Article number4811598
Pages (from-to)2081-2086
Number of pages6
JournalConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
DOIs
StatePublished - Dec 1 2008
Event2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008 - Singapore, Singapore
Duration: Oct 12 2008Oct 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

Fingerprint

Dive into the research topics of 'Tractability of deadlock avoidance problem in automated manufacturing systems modeled with petri net'. Together they form a unique fingerprint.

Cite this