Iterative deadlock control by using petri nets

Document Type

Article

Publication Date

4-24-2012

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 paper 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. We 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. © 1998-2012 IEEE.

Identifier

84871718723 (Scopus)

Publication Title

IEEE Transactions on Systems Man and Cybernetics Part C Applications and Reviews

External Full Text Location

https://doi.org/10.1109/TSMCC.2012.2189385

ISSN

10946977

First Page

1204

Last Page

1218

Issue

6

Volume

42

Grant

2008AA04Z109

Fund Ref

Alexander von Humboldt-Stiftung

This document is currently not available here.

Share

COinS