Deadlock avoidance in flexible manufacturing systems using finite automata
01 Aug 2000-Vol. 16, Iss: 4, pp 424-429
TL;DR: The issue of deadlock avoidance in systems having these characteristics and a deadlock-free and maximally permissive control policy that incorporates this flexibility is developed based on finite automata models of part process plans and the FMS.
Abstract: A distinguishing feature of a flexible manufacturing system (FMS) is the ability to perform multiple tasks in one machine or workstation (alternative machining) and the ability to process parts according to more than one sequence of operations (alternative sequencing). In this paper, we address the issue of deadlock avoidance in systems having these characteristics. A deadlock-free and maximally permissive control policy that incorporates this flexibility is developed based on finite automata models of part process plans and the FMS. The resulting supervisory controller is used for dynamic evaluation of deadlock avoidance based on the remaining processing requirements of the parts.
Citations
More filters
01 Jan 2004
TL;DR: This paper intends to present a tutorial survey of state-of-the art modeling and deadlock control methods for discrete manufacturing systems and presents the updated results in the areas of deadlock prevention, detection and recovery, and avoidance.
Abstract: As more and more producers move to use flexible and agile manufacturing as a way to keep them with a competitive edge, the investigations on deadlock resolution in automated manufacturing have received significant attention for a decade. Deadlock and related blocking phenomena often lead to catastrophic results in automated manufacturing systems. Their efficient handling becomes a necessary condition for a system to gain high productivity. This paper intends to present a tutorial survey of state-of-the art modeling and deadlock control methods for discrete manufacturing systems. It presents the updated results in the areas of deadlock prevention, detection and recovery, and avoidance. It focuses on three modeling methods: digraphs, automata, and Petri nets. Moreover, for each approach, the main and relevant contributions are selected enlightening pros and cons. The paper concludes with the future research needs in this important area in order to bridge the gap between the academic research and industrial needs.
334 citations
Cites methods from "Deadlock avoidance in flexible manu..."
...Using the same framework, Yalcin and Boucher [67] model an AMS as a finite automaton that describes the states of resources and possible part movements....
[...]
01 Jul 2012
TL;DR: This study surveys the state-of-the-art deadlock-control strategies for automated manufacturing systems by reviewing the principles and techniques that are involved in preventing, avoiding, and detecting deadlocks.
Abstract: Deadlocks are a rather undesirable situation in a highly automated flexible manufacturing system. Their occurrences often deteriorate the utilization of resources and may lead to catastrophic results in safety-critical systems. Graph theory, automata, and Petri nets are three important mathematical tools to handle deadlock problems in resource allocation systems. Particularly, Petri nets are considered as a popular formalism because of their inherent characteristics. They received much attention over the past decades to deal with deadlock problems, leading to a variety of deadlock-control policies. This study surveys the state-of-the-art deadlock-control strategies for automated manufacturing systems by reviewing the principles and techniques that are involved in preventing, avoiding, and detecting deadlocks. The focus is deadlock prevention due to its large and continuing stream of efforts. A control strategy is evaluated in terms of computational complexity, behavioral permissiveness, and structural complexity of its deadlock-free supervisor. This study provides readers with a conglomeration of the updated results in this area and facilitates engineers in finding a suitable approach for their industrial scenarios. Future research directions are finally discussed.
274 citations
Cites background from "Deadlock avoidance in flexible manu..."
...Lawley, Reveliotis, and Ferreira are distinguished experts in this area [125],[126], [127], [128], [129], [130], [131], [132], [133], [183], [236]....
[...]
06 Oct 2002
TL;DR: A deadlock avoidance algorithm for a class of resource allocation systems modeling manufacturing systems that has a nonsequential nature and the usefulness of the proposed solution is shown by means of its application to a real system.
Abstract: The paper concentrates on the deadlock-avoidance problem for a class of resource allocation systems modeling manufacturing systems. In these systems, a set of production orders have to be executed in a concurrent way. To be executed, each step of each production order needs a set of reusable system resources. The competition for the use of these resources can lead to deadlock problems. Many solutions, from different perspectives, can be found in the literature for deadlock-related problems when the production orders have a sequential nature [sequential resource allocation systems (S-RAS)]. However, in the case in which the involved processes have a nonsequential nature [nonsequential resource allocation systems (NS-RAS)], the problem becomes more complex. In this paper, we propose a deadlock avoidance algorithm for this last class of systems. We also show the usefulness of the proposed solution by means of its application to a real system.
88 citations
Cites background from "Deadlock avoidance in flexible manu..."
...This approach gives, in general, more permissive results, with the drawback that in some cases, the size of the state space (the state space explosion) can make these approaches to be nonapplicable (see [5]–[8])....
[...]
TL;DR: A thorough review of the state-of-the-art research results about modeling and optimal scheduling of clusters tools and indicates the future research directions is presented.
Abstract: Cluster tools are automated robotic manufacturing systems containing multiple computer-controlled process modules. They have been increasingly used for wafer fabrication. This paper reviews the modeling and scheduling methods for cluster tools with both nonrevisiting and revisiting processes. For nonrevisiting processes, we focus on the modeling and scheduling problems of cluster tools with different constraints. Then, their solution methods are reviewed and compared. For revisiting processes, this paper first discusses the scheduling problem of some general manufacturing systems with revisiting. Then, the modeling and scheduling methodologies used to solve the scheduling problems of cluster tools with revisiting processes are reviewed. Future research directions and conclusions are finally discussed. Note to Practitioners —Semiconductor manufacturing systems are among the most advanced and complicated manufacturing systems. Their key equipment is highly automated robot-based cluster tools. With wafer residency time constraints, wafer revisiting, activity time variation, chamber cleaning requirements, and failure-prone process modules (PMs), it is very challenging to schedule and control them. This paper surveys their modeling and scheduling methods. Scheduling them requires one to schedule their robot tasks and processing activities simultaneously. Owing to wafer residency time constraints and the lack of buffers among PMs, it is difficult to conduct their optimal scheduling. This paper presents a thorough review of the state-of-the-art research results about modeling and optimal scheduling of clusters tools and indicates the future research directions.
78 citations
Cites background from "Deadlock avoidance in flexible manu..."
...effective and efficient deadlock-control policies are developed based on automata [63], [64], [102], [103], [135]....
[...]
TL;DR: It has been shown experimentally that the developed siphon truncation technique enhances the ability to develop deadlock-free schedules of systems with a high number of deadlocks, which cannot be achieved using standard Petri net scheduling approaches.
Abstract: This paper addresses the deadlock-free scheduling problem in Flexible Manufacturing Systems. An efficient deadlock-free scheduling algorithm was developed, using timed Petri nets, for a class of FMSs called Systems of Sequential Systems with Shared Resources (S 4 R). The algorithm generates a partial reachability graph to find the optimal or near-optimal deadlock-free schedule in terms of the firing sequence of the transitions of the Petri net model. The objective is to minimize the mean flow time (MFT). An efficient truncation technique, based on the siphon concept, has been developed and used to generate the minimum necessary portion of the reachability graph to be searched. It has been shown experimentally that the developed siphon truncation technique enhances the ability to develop deadlock-free schedules of systems with a high number of deadlocks, which cannot be achieved using standard Petri net scheduling approaches. It may be necessary, in some cases, to relax the optimality condition for large F...
62 citations
Cites background from "Deadlock avoidance in flexible manu..."
...…Xing et al. 1996), and graph theoretic procedures (Boucher et al. 2000, Fanti et al. 1997, 2000, Kim and Kim 1997, Kumaran et al. 1994, Lawley 1999, Lawley et al. 1997, Reviolitis 1999, Reviolitis and Ferreira 1996, Reviolitis et al. 1997, Yalcin 2000, Yalcin and Boucher 2000, Yim et al. 1997)....
[...]
...…attention to routing ¯exibility in the deadlock-free policy development (Ben Abdallah and ElMaraghy 1998, Ben Abdallah et al. 1998a, Barkaoui and Ben Abdallah 1996, Boucher et al. 2000, Ezpeleta et al. 1995, Fanti et al. 2000, Lawlay 1999, 2000, Reviolitis 1999, WU 1999, Yalcin and Boucher 2000)....
[...]
References
More filters
TL;DR: The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples of an improved version of an algorithm for finding the strongly connected components of a directed graph.
Abstract: The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected componen...
5,660 citations
TL;DR: In this paper, the control of a class of discrete event processes, i.e., processes that are discrete, asynchronous and possibly non-deterministic, is studied. And the existence problem for a supervisor is reduced to finding the largest controllable language contained in a given legal language, where the control process is described as the generator of a formal language, while the supervisor is constructed from the grammar of a specified target language that incorporates the desired closed-loop system behavior.
Abstract: This paper studies the control of a class of discrete event processes, i.e. processes that are discrete, asynchronous and possibly nondeter-ministic. The controlled process is described as the generator of a formal language, while the controller, or supervisor, is constructed from the grammar of a specified target language that incorporates the desired closed-loop system behavior. The existence problem for a supervisor is reduced to finding the largest controllable language contained in a given legal language. Two examples are provided.
3,432 citations
01 Apr 1995
TL;DR: This paper illustrates a compositional method for modeling the concurrent execution of working processes in flexible manufacturing systems (FMS) through a special class of Petri nets that is built from state machines sharing a set of places modeling the availability of system resources.
Abstract: In this paper we illustrate a compositional method for modeling the concurrent execution of working processes in flexible manufacturing systems (FMS) through a special class of Petri nets that we call S/sup 3/PR. In essence, this class is built from state machines sharing a set of places modeling the availability of system resources. The analysis of S/sup 3/PR leads us to characterize deadlock situations in terms of a zero marking for some structural objects called siphons. In order to prevent the system from deadlocks, we propose a policy for resource allocation based on the addition of new places to the net imposing restrictions that prevent the presence of unmarked siphons (direct cause of deadlocks). Finally we present the application of this technique to a realistic FMS case. >
1,108 citations
01 Dec 1990
TL;DR: The authors develop a Petri net model of concurrent job flow and dynamic resource allocation in an FMS and define deadlock in terms of transition enabling in the PN model to prove that restricted deadlock can never occur for any resource allocation policy implemented under the DAA restriction policy.
Abstract: The concurrent flow of multiple jobs through a FMS can lead to deadlock conditions due to competition for limited resources in the system. The authors develop a Petri net (PN) model of concurrent job flow and dynamic resource allocation in an FMS and define deadlock in terms of transition enabling in the PN model. The problem of deadlock avoidance is addressed by introducing the notion of a restriction policy, which is a feedback policy for excluding some enabled transitions from the current resource allocation alternatives. The authors then present their deadlock avoidance algorithm (DAA) and prove that restricted deadlock can never occur for any resource allocation policy implemented under the DAA restriction policy. The DAA can be implemented easily in real time and is much less restrictive for FMS applications than existing algorithms for deadlock avoidance in computer systems. Application of the DAA is illustrated for three FMS examples: allocation of finite buffer space in a multicell machining facility, collision avoidance in a multirobot assembly cell, and coordination of multiple AGVs on a shop floor. >
522 citations
01 Dec 1997
TL;DR: This paper exploits the potential of siphons for the analysis of Petri nets and shows that an asymmetric choice net is live iff it is potential-deadlock-free and an augmented marked graph is live and reversible iff the siphon is not a potential deadlock.
Abstract: This paper exploits the potential of siphons for the analysis of Petri nets, It generalizes the well-known Commoner condition and is based on the notion of potential deadlocks which are siphons that eventually become empty. A linear programming based sufficient condition under which a siphon is not a potential deadlock is obtained. Based on the new sufficient condition, a mathematical programming approach and a mixed-integer programming approach are proposed for checking general Petri nets and structurally bounded Petri nets respectively without explicitly generating siphons. Stronger results are obtained for asymmetric choice nets and augmented marked graphs. In particular, we show that an asymmetric choice net is live iff it is potential-deadlock-free and an augmented marked graph is live and reversible iff it is potential-deadlock-free.
466 citations