Iterative deadlock control for Petri net models of automated manufacturing systems: Algorithms and case studies

Anrong Wang, Meng Chu Zhou

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Deadlocks should be eliminated in resource allocation systems such as flexible manufacturing systems. An iterative deadlock control policy is usually considered to be a natural solution with reasonable computational cost for a large-scale system where direct methods would be prohibitively expensive (and in some cases impossible) even with the best available computing power. This chapter reviews the existing iterative deadlock prevention policies for discrete event systems that are modeled with Petri nets. A number of technical problems in the existing iterative deadlock control approaches are formulated and discussed. Their solutions are illustrated through case studies. The authors conclude that the suitability, effectiveness, and efficiency of an iterative deadlock control approach are sensitive to specific examples and no general algorithm is found in the literature, which works well for all cases.

Original languageEnglish (US)
Title of host publicationFormal Methods in Manufacturing Systems
Subtitle of host publicationRecent Advances
PublisherIGI Global
Pages296-321
Number of pages26
ISBN (Electronic)9781466640351
ISBN (Print)1466640340, 9781466640344
DOIs
StatePublished - May 31 2013

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Iterative deadlock control for Petri net models of automated manufacturing systems: Algorithms and case studies'. Together they form a unique fingerprint.

Cite this