scholarly journals Enhancement of Selective Siphon Control Method for Deadlock Prevention in FMSs

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Yen-Liang Pan ◽  
Cheng-Fu Yang ◽  
Mu-Der Jeng
Keyword(s):  
Computational Efficiency ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Control Method ◽  
Control Policy ◽  
Experimental Results ◽  
Deadlock Prevention ◽  
Exact Number ◽  
Sequential Processes

One novel control policy named selective siphon control policy is proposed to solve for deadlock problems of flexible manufacturing systems (FMSs). The new policy not only solves the deadlock problem successfully but also obtains maximally permissive controllers. According to our awareness, the policy is the first one to achieve the goal of obtaining maximally permissive controllers for all S3PR (one system of simple sequential processes with resources, S3PR) models in existing literature. However, one main problem is still needed to solve in their algorithm. The problem is that the proposed policy cannot check the exact number of maximally permissive states of a deadlock net in advance. After all iterating steps, the final maximally permissive states can then be known. Additionally, all legal markings are still to be checked again and again until all critical markings vanished. In this paper, one computationally improved methodology is proposed to solve the two problems. According to the experimental results, the computational efficiency can be enhanced based on the proposed methodology in this paper.

Petri Net Channelized-Based Deadlock Prevention Policy for Flexible Manufacturing Systems

2011 ◽  
Vol 317-319 ◽  
pp. 552-555
Author(s):  
Yi Sheng Huang ◽  
Ter Chan Row
Keyword(s):  
Control System ◽  
Petri Net ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Control Policy ◽  
Original Model ◽  
Deadlock Prevention ◽  
Prevention Policy ◽  
Maximal Permissiveness

Petri nets are employed to model flexible manufacturing systems (FMSs). However, the system deadlocked are possible happened. The conventional deadlock prevention policies are always to forbid the system entering the deadlock by using the control places. To obtain a live system, some dead markings must be sacrificed in the traditional policies. Therefore, the original reachability states of the original model can not be conserved. However, this paper is able to maintain all the reachability states of the original net and guaranty the control system live. Under our control policy, all number of reachability states of the original net will be preserved. Finally, two examples are performed that can reach the maximal permissiveness for FMSs using Petri net models (PNMs).

A Channelized Deadlock Prevention Policy for Flexible Manufacturing Systems Using Petri Net Models

2011 ◽  
Vol 284-286 ◽  
pp. 1498-1501
Author(s):  
Yi Sheng Huang ◽  
Ter Chan Row
Keyword(s):  
Petri Net ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Control Policy ◽  
Deadlock Avoidance ◽  
Deadlock Prevention ◽  
Deadlock Detection ◽  
Prevention Policy ◽  
Maximal Permissiveness

Deadlock prevention, deadlock detection and deadlock avoidance strategies are used to solve the deadlock problems of flexible manufacturing systems (FMSs). The conventional prevention policies were always attempt to prevent the system entering the deadlocked situation by using a few control places. On can know that one prohibits the deadlocked markings, some dead markings will be sacrificed. Therefore, the reachability states will become less than the initial net. However, our goal is to preserve all the reachability states of the initial net. Under our control policy, the deadlocks or deadlock zone will be channelized to live markings such that all the dead markings in reachability states will be conserved. Finally, an example is performed and can obtain the maximal permissiveness of a Petri net model. The other examples are all getting the same result. To our knowledge, this is the first work that employs the channelized method to prevent the deadlock problem for FMSs.

scholarly journals Maximally permissive deadlock prevention policies for flexible manufacturing systems using control transition

2018 ◽  
Vol 10 (7) ◽  
pp. 168781401878740 ◽  
Author(s):  
Ter-Chan Row ◽  
Yen-Liang Pan
Keyword(s):  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Experimental Results ◽  
Deadlock Prevention ◽  
Routing Flexibility ◽  
Reachability Graph ◽  
Shared Resources ◽  
Prevention Policies ◽  
Graph Method

Nowadays, many kinds of flexible manufacturing systems are used to process many complex manufacturing works due to their machine flexibility and routing flexibility. However, such competition (i.e. robots and machines) for shared resources by concurrent job processes can lead to the problem of a system deadlock. In existing researches, almost experts adopted place-based as controllers to solve the deadlock problems of flexible manufacturing systems whatever the concept of siphons or the reachability graph method are used. Among them, only the reachability graph ones can obtain maximally permissive live states. In this article, the authors try to propose one novel transition-based deadlock prevention concept to solve flexible manufacturing system’s deadlock problem. In addition, two algorithms are developed to support above concept. The experimental results indicate that the proposed policy not only can obtain maximally permissive controllers but also recover all original deadlock markings.

A Computationally Improved Control Policy for FMS Using Crucial Marking/Transition-Separation Instances

2013 ◽  
pp. 61-82
Author(s):  
Yi-Sheng Huang ◽  
Yen-Liang Pan
Keyword(s):  
Petri Net ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Control Policy ◽  
Deadlock Avoidance ◽  
Deadlock Prevention ◽  
Deadlock Detection ◽  
Optimal Controllers ◽  
Unique Method

Deadlock prevention, deadlock detection, and deadlock avoidance strategies are used to solve the deadlock problems of Flexible Manufacturing Systems (FMS). The theory of regions has been recognized as the unique method for obtaining maximally permissive controllers in the existing literature. All legal and live maximal behavior of a Petri net model can be preserved by using a Marking/Transition-Separation Instance (MTSI). However, obtaining all sets of MTSIs is an extremely time consuming problem. This work proposes Crucial Marking/Transition-Separation Instances (CMTSIs) that allow designers to employ few MTSIs to deal with deadlocks. The advantage of the proposed policy is that a maximally permissive controller can be obtained with drastically reduced computation. Experimental results, by varying the markings of given net structures, indicate that it is the most efficient policy to obtain optimal controllers among existing methods based on the theory of regions.

scholarly journals One Computational Innovation Transition-Based Recovery Policy for Flexible Manufacturing Systems Using Petri nets

2020 ◽  
Vol 10 (7) ◽  
pp. 2332 ◽  
Author(s):  
Yen-Liang Pan
Keyword(s):  
Petri Nets ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Control Policy ◽  
Deadlock Prevention ◽  
Three Dimension ◽  
Factory Production ◽  
Almost All ◽  
Industrial Revolutions

In the third and fourth industrial revolutions, smart or artificial intelligence flexible manufacturing systems (FMS) seem to be the key machine equipment for capacity of factory production. However, deadlocks could hence appear due to resources competition between robots. Therefore, how to prevent deadlocks of FMS occurring is a very important and hot issue. Based on Petri nets (PN) theory, in existing literature almost all research adopts control places as their deadlock prevention mean. However, under this strategy the real optimal reachable markings are not achieved even if they claimed that their control policy is maximally permissive. Accordingly, in this paper, the author propose one novel transition-based control policy to solve the deadlock problem of FMS. The proposed control policy could also be viewed as deadlock recovery since it can recover all initial deadlock and quasi-deadlock markings. Furthermore, control transitions can be calculated and obtained once the proposed three-dimension matrix, called generating and comparing aiding matrix (GCAM) in this paper, is built. Finally, an iteration method is used until all deadlock markings become live ones. Experimental results reveal that our control policy seems still the best one among all existing methods in the literature regardless of whether these methods belong to places or transitions based.

scholarly journals One Novel and Optimal Deadlock Recovery Policy for Flexible Manufacturing Systems Using Iterative Control Transitions Strategy

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Ter-Chan Row ◽  
Wei-Ming Syu ◽  
Yen-Liang Pan ◽  
Ching-Cheng Wang
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Experimental Results ◽  
Reachability Graph ◽  
Sequential Processes ◽  
Iterative Control

This paper focuses on solving deadlock problems of flexible manufacturing systems (FMS) based on Petri nets theory. Precisely, one novel control transition technology is developed to solve FMS deadlock problem. This new proposed technology can not only identify the maximal saturated tokens of idle places in Petri net model (PNM) but also further reserve all original reachable markings whatever they are legal or illegal ones. In other words, once the saturated number of tokens in idle places is identified, the maximal markings of system reachability graph can then be checked. Two classical S3PR (the Systems of Simple Sequential Processes with Resources) examples are used to illustrate the proposed technology. Experimental results indicate that the proposed algorithm of control transition technology seems to be the best one among all existing algorithms.

Sign in / Sign up

Export Citation Format

Share Document