A Siphon-based Deadlock Prevention Policy for a Class of Petri Nets - S3PMR

Yan, Mingming; Zhu, Ruijie; Li, Zhiwu; Zhou, MengChu

doi:10.3182/20080706-5-kr-1001.02451

Cited by 3 publications

(10 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There exist many papers where siphons and traps are defined -see e.g. [72,84,58,60,61,92,93,54] and many newer ones mostly written by Chinese authors [63,8,25,55,56,57,59,62,64,28,29,30,31,32,33,34,35,36,37,38,39,40]. Siphons and traps are basic net structures of PN [84] which allow important views on the behaviour of the modelled system as well as on some implications on this behaviour.…”

Section: Siphons Traps Deadlocks Invariants Repetitive and Characteristic Vectorsmentioning

confidence: 99%

“…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%

“…The special syntactic characteristics of this class allow to study the modelled systems from a structural perspective. The newer publications [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,52,53] investigate also such kinds of AMS/FMS.…”

Section: Resource Allocation Systems Vs Petri Netsmentioning

confidence: 99%

See 2 more Smart Citations

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%

Section: Siphons Traps Deadlocks Invariants Repetitive and Characteristic Vectorsmentioning

confidence: 99%

See 1 more Smart Citation

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

“…This approach makes the behavioral permissiveness of a controller get a obvious improvement. The deadlock prevention policies underlying the idea of elementary siphons can also be found in [35,36]. In addition, the condition proposed in [29] is too conservative, in many cases, to judge the controllability of dependent siphons.…”

Section: Deadlock Prevention and Siphonmentioning

confidence: 99%

A Literature Review of Deadlock Prevention Policy Based on Petri Nets for Automated Manufacturing Systems

Guan¹,

Li²,

Xu³

et al. 2012

JDCTA

View full text Add to dashboard Cite

Deadlock is an undesired situation in a highly automated system due to the fact that no system can allow its occurrence which may produce some unnecessary economic losses or serious consequences. There are three mathematical tools to handle deadlocks in resource allocation systems: graph theory, finite state machine, and Petri net. Due to its inherent characteristics, Petri nets are widely applied to manufacturing systems. Generally, these existing deadlock methods are classified into three strategies: deadlock detection and recovery, deadlock avoidance, and deadlock prevention. In this paper, a review of deadlock prevention policies and merits and drawbacks of these policies are presented. Then it gives the possible trend of the research in the future.

show abstract

“…Finally, the uncontrolled S 3 PR model shown in Figure 9 (Huang et al 2004, Li and Zhou 2004, Yan et al 2008) is prone to deadlock, where P 0 ¼ { p 1 , p 10 }, P A ¼ { p 2 , p 3 , p 4 , p 5 , p 6 , p 7 , p 8 , p 9 }, P R ¼ { p 11 , p 12 , p 13 , p 14 , p 15 }, and jPj ¼ jP 0 j þ jP A j þ jP R j ¼ 15. The number of maximally permissive states is 336 > .…”

mentioning

confidence: 99%

Solving siphons with the minimal cardinality in Petri nets and its applications to deadlock control

Li¹,

Li²

2012

International Journal of Production Research

Self Cite

View full text Add to dashboard Cite

Siphons can be used to characterise deadlock states and solve deadlock problems in Petri nets that model flexible manufacturing systems. By modifying the objective function and adding new constraints to the mixedinteger programming (MIP) method proposed by Park and Reveliotis, this paper presents a revised MIP (RMIP) to directly solve siphons, called smart siphons, with the minimal cardinality as well as the minimal number of resource places. Accordingly, an iterative siphon-based control (ISC) method adds a proper control place (CP) to make each smart siphon max-controlled until the controlled system is live. Since any siphon that has more resource places can be composed of those containing less resource places, a small number of CPs are required during the iterative control process due to the solved smart siphons containing the minimal number of resource places. Compared with the existing methods in the literature, the proposed ISC method using the RMIP avoids computing a maximal deadly marked siphon from which a minimal siphon is then derived, adds a small number of proper CPs, and leads to a liveness-enforcing supervisor with a simple structure. Finally, a case study demonstrates the effectiveness of the proposed ISC method.

show abstract

A Siphon-based Deadlock Prevention Policy for a Class of Petri Nets - S3PMR

Cited by 3 publications

References 23 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 Literature Review of Deadlock Prevention Policy Based on Petri Nets for Automated Manufacturing Systems

Solving siphons with the minimal cardinality in Petri nets and its applications to deadlock control

Contact Info

Product

Resources

About