This Article Full Text (OnlineFirst PDF) Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Citing Articles Citing Articles via Scopus Google Scholar Articles by Hu, H S Social Bookmarking                         What's this?

An iterative deadlock prevention approach for automated manufacturing systems

School of Electro-mechanical Engineering, Xidian University, Xi'an, Shaanxi, PRC

^* To whom correspondence should be addressed. E-mail: hshu{at}mail.xidian.edu.cn.

	Abstract

This paper considers an iterative deadlock prevention policy in the context of the automated manufacturing systems (AMS) that constitute one of the major production technologies in modern industry. Owing to the specialty of an AMS, the reachability graph (RG) of its given Petri net model shows powerful analysis and control capability to crack such a hard nut. However, the fact that the number of nodes involved in an RG grows exponentially with the size of a Petri net model makes all the RG-based policies infeasible. The approach conducted in this paper illustrates that the bad nodes in an RG can be extracted iteratively by a set of mixed integer programming formulations so that the explicit enumeration of all nodes of the RG is avoided. The proposed approach promises a computationally efficient policy that guarantees a nearly optimal liveness-enforcing supervisor.

First published on August 6, 2009
Transactions of the Institute of Measurement and Control 2009, doi:10.1177/0142331208095620


CiteULike    Complore    Connotea    Del.icio.us    Digg    Reddit    Technorati    Twitter    What's this?