Abstract
Most existing deadlock prevention policies deal with deadlock problems arising in flexible manufacturing systems modeled with Petri nets by adding control places. Based on the reachability graph analysis, this article proposes a novel deadlock control policy that recovers the system from deadlock and livelock states to legal states and reaches the same number of states as the original plant model by adding control transitions. In order to reduce the structural complexity of the supervisor, a set covering approach is developed to minimize the number of control transitions. Finally, two flexible manufacturing system examples are presented to illustrate the proposed approach.
Highlights
Flexible manufacturing systems (FMSs) are widely used to produce various workpieces using machines, robots, and automated guided vehicles, which are recognized as shared resources
There are mainly two Petri net analysis techniques used to deal with deadlock prevention: structure analysis[7,8,19,20,21,22,23,24,25] and reachability graph analysis.[15,26,27,28,29,30]
The former always derives a deadlock prevention policy based on special structural objects of a Petri net such as siphons or resource-transition circuits
Summary
Flexible manufacturing systems (FMSs) are widely used to produce various workpieces using machines, robots, and automated guided vehicles, which are recognized as shared resources. Let (N , M0) be a pure Petri net, ML, MLL, and MD be the sets of legal, livelock, and deadlock markings in R(N , M0), respectively. To obtain a live controlled system, all the deadlock and livelock markings in MD [ MLL need to be recovered to legal ones.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
