Petri net controllers for Generalized Mutual Exclusion Constraints with floor operators

Ma, Ziyue; Li, Zhiwu; Giua, Alessandro

doi:10.1016/j.automatica.2016.07.042

Cited by 27 publications

(12 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Of course, since that time the deadlock theory, and especially the deadlock avoidance one, has been intensively developed -see e.g. [46,78,79,80,81,75,74,73,82,86,87] and especially [63,8,25,55,56,57,59,62,64,28,29,30,31,32,33,34,35,36,37,38,39,40,92,93,94,91,88,89,65,66,67,68,69,58,60,61,47,48,49,50,51,…”

Section: Siphons Traps Deadlocks Invariants Repetitive and Characteristic Vectorsmentioning

confidence: 99%

Modelling and Control of Resource Allocation Systems within Discrete Event Systems by Means of Petri Nets -- Part 1: Invariants, Siphons and Traps in Deadlock Avoidance

Čapkovič

2021

cai

View full text Add to dashboard Cite

Solving the deadlocks avoidance problem in Resource Allocation Systems (RAS) in Discrete-Event Systems (DES) is a rife problem, especially in Flexible Manufacturing Systems (FMS), alias Automated Manufacturing Systems (AMS). Petri Nets (PN) are an effectual tool often used at this procedure. In principle, there are two basic approaches how to deal with deadlocks in RAS based on PN. They are listed and illustrated here. First of the approaches is realized by means of the supervisor based on P-invariants of PN, while the second one is realized by means of the supervisor based on PN siphons. While the first approach needs to know the reachability graph/tree (RG/RT) expressing the causality of the development of the PN model of RAS, in order to find (after its thorough analysis) the deadlocks, the second approach needs the thorough analysis of the PN model structure by means of finding siphons and traps. Next, both approaches will be applied on the same PN model of RAS and the effectiveness of the achievement of their results will be compared and evaluated. Several simple illustrative examples will be introduced. For the in-depth analysis of the problem of deadlock avoiding, next Part 2 of this paper is prepared, where the newest research will be introduced and illustrated on more complicated examples. If necessary (because of the limited length of particular papers), also the third part -Part 3, will be prepared.

show abstract

Section: Siphons Traps Deadlocks Invariants Repetitive and Characteristic Vectorsmentioning

confidence: 99%

Modelling and Control of Resource Allocation Systems within Discrete Event Systems by Means of Petri Nets -- Part 1: Invariants, Siphons and Traps in Deadlock Avoidance

Čapkovič

2021

cai

View full text Add to dashboard Cite

show abstract

“…However, it may lead to deadlocks, blocking the entire system or part of it, due to an inappropriate allocation of resources in the system. It is significant to develop an effective control policy to solve the problem of deadlocks [1]- [6], [8], [14]- [17], [20], [21], [29]- [42], [45], [46], [50]- [53], [67] in an FMS. There…”

Section: Introductionmentioning

confidence: 99%

A Deadlock Prevention Policy for Flexible Manufacturing Systems Modeled With Petri Nets Using Structural Analysis

et al. 2019

View full text Add to dashboard Cite

This paper derives an iterative deadlock prevention policy for systems of simple sequential processes with resources (S 3 PRs) based on structural analysis, which consists of two stages. The first stage is called siphons control. Strict minimal siphons (SMSs) in an S 3 PR net are computed and control places are added by imposing P-invariants associated with the complementary sets of the SMSs, which restricts no legal system behavior. The original resource places are removed and the newly added control places are regarded as resource places, resulting in a new net, which needs to add control places for its SMSs if deadlocks persist. Repeat this step until a new net without SMSs is obtained. Then, an S 4 PR, called the first-controlled net, is obtained by integrating all added control places into the original net. The second stage, called non-maxmarked siphons control, is performed in an iterative way if the system is not live yet. At each iteration, a mixed integer linear programming (MILP) problem is formulated to compute a non-max-marked siphon, and a control place is added for the siphon to the first-controlled net, resulting in an augmented net. The iteration is executed until a final-augmented net generates no new non-max-marked siphon. In general, based on the above two stages, this paper can obtain a supervisor with more behavior permissiveness compared to the previous studies. Moreover, an optimal supervisor can be found if a first-controlled net has no nonmax-marked siphon, implying that the second stage is not necessary. Finally, some examples are provided to demonstrate the proposed policy.INDEX TERMS Flexible manufacturing system, Petri net, deadlock prevention policy, structural analysis.

show abstract

“…Thus, there are a number of PN‐based approaches to solve deadlock problems . Meanwhile, PNs have been extensively applied to supervisory control problems , scheduling and planning , and performance evaluation . Deadlock prevention is a crucial approach with its major aim to implement an off‐line computation strategy and find a supervisor that supervises the evolution of a system to inhibit it from reaching deadlocks.…”

Section: Introductionmentioning

confidence: 99%

Design of Optimal Petri Net Supervisors for Flexible Manufacturing Systems via Weighted Inhibitor Arcs

Cong

Uzam

et al. 2017

Asian Journal of Control

Self Cite

View full text Add to dashboard Cite

This paper develops an approach to the design of an optimal Petri net supervisor that enforces liveness to flexible manufacturing systems. The supervisor contains a set of observer places with weighted inhibitor arcs. An observer place with a weighted inhibitor arc is used to forbid a net from yielding an illegal marking by inhibiting the firing of a transition at a marking while ensuring that all legal markings are preserved. A marking reduction technique is presented to decrease the number of considered markings, which can dramatically lower the computational burden of the proposed approach. An integer linear program is presented to simplify the supervisory structure by minimizing the number of observer places. Finally, several examples are used to shed light on the proposed approach which can lead to an optimal supervisor for the net models that cannot be optimally controlled via pure Petri net supervisors.

show abstract

Petri net controllers for Generalized Mutual Exclusion Constraints with floor operators

Cited by 27 publications

References 31 publications

Modelling and Control of Resource Allocation Systems within Discrete Event Systems by Means of Petri Nets -- Part 1: Invariants, Siphons and Traps in Deadlock Avoidance

Modelling and Control of Resource Allocation Systems within Discrete Event Systems by Means of Petri Nets -- Part 1: Invariants, Siphons and Traps in Deadlock Avoidance

A Deadlock Prevention Policy for Flexible Manufacturing Systems Modeled With Petri Nets Using Structural Analysis

Design of Optimal Petri Net Supervisors for Flexible Manufacturing Systems via Weighted Inhibitor Arcs

Contact Info

Product

Resources

About