Paper Info
Title
Deadlock control policy for a class of automated manufacturing systems with key resources
Abstract
For automated manufacturing systems (AMSs) without center resources that are one-unit resources shared by two or more maximal perfect resource transition circuits, the optimal Petri net-based polynomial complexity deadlock avoidance policies are synthesized in our previous work. Based on Petri net models of AMSs, this work focuses on the deadlock control problem for AMSs with center resources. First, the concepts of key resources and key transitions are presented. It can prove that key transitions can bring AMSs with key resources into secondary-deadlock, i.e. the controlled Petri nets of AMSs with key resources are not live. Second, for a class of AMSs with key resources, secondary-deadlock can be characterized by maximal perfect control transition circuits (MPCT-circuits) that are saturated at a reachable marking of the controlled system. Then, by adding a control place and related arcs to each MPCT-circuit, secondary-deadlock can be prevented. Thereby, a deadlock control policy for a class of AMSs with center resources is synthesized. Finally, a few examples are provided to demonstrate the presented policy and used to compare them with the state-of-the-art methods.
Year
DOI
Venue
2015
10.1109/ICNSC.2015.7116085
ICNSC
Keywords
Field
DocType
Automated manufacturing systems, deadlock control, Petri net
Petri net,Polynomial,Computer science,Manufacturing systems,System recovery,Deadlock,Polynomial complexity,Deadlock prevention algorithms,Distributed computing
Conference
ISSN
Citations 
PageRank 
1810-7869
0
0.34
References 
Authors
13
2
Name
Order
Citations
PageRank
Huixia Liu100.34
Weimin Wu223643.97