On liveness and a class of generalized Petri nets

Abdul-Hussin, Mowafak Hassan; Banaszak, Zbigniew

doi:10.1109/iemecon.2017.8079601

Cited by 9 publications

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Now, we introduce MMIP-2 that is applicable to an S 4 PR given a set P c ⊆ P R . The only difference between MMIP-1 and MMIP-2 is the introduction of constraint (12) in MMIP-2. It is easy to see that, due to the constraint (12), an emptiable siphon excluding places in P c is computed by solving the MMIP-2 problem.…”

Section: Volume 7 2019mentioning

confidence: 99%

See 1 more Smart Citation

A Siphon-Based Deadlock Prevention Strategy for S³PR

et al. 2019

View full text Add to dashboard Cite

Iterative deadlock prevention strategies based on siphons have drawn increasing attention. For iterative strategies, selecting which siphon to control at each iteration has an influence on the final supervisor in structural complexity, computational complexity, and behavioral permissiveness. In this paper, we define two kinds of emptiable siphons and provide two modified mixed-integer programming (MIP) formulations to compute such siphons. On the basis of them, a three-stage iterative deadlock prevention policy that specifies the siphon control order is proposed. The experimental results show that a supervisor with a simpler structure, higher behavioral permissiveness, and lower computational complexity can be obtained by the proposed strategy since neither the exhaustive siphon enumeration nor the reachability analysis is required. INDEX TERMS Deadlock prevention, discrete event systems, mixed integer programming, Petri nets.

show abstract

Section: Volume 7 2019mentioning

confidence: 99%

“…v p = 1, ∀p ∈ P C (12) Proposition 5: Given an S 4 PR (N , M 0 ) with N = (P 0 ∪ P A ∪ P R , T , F, W ), and a set of resource places P c ⊆ P R , a solution of MMIP-2 corresponds to a P c -excluded ω-siphon.…”

Section: Constraints (2-8) Andmentioning

confidence: 99%

A Siphon-Based Deadlock Prevention Strategy for S³PR

et al. 2019

View full text Add to dashboard Cite

show abstract

“…The existing approaches to measuring FMS are Petri nets have well-known properties over other models which are demonstrated to be a tool for prominent capabilities to describe FMS. Abdul-Hussin et al, [9,10] describe a simulations PN by Matlab in order to show that the reachability graph and total computational are required to investigate the deadlock that siphons analyses can be utilized to determine if deadlοсk markings are reachable.…”

Section: Introductionmentioning

confidence: 99%

“…Our approach is the dynamic simulation of interpreted adaptive Siphons PN under supervision are required to be sufficiently marked at any reachable marking from an initial marking. Pеtri Nets were used in [9,10], employs deadlосk рreνentіon baѕed on the structure sірhons analyzed, and reachability graphs PNs are used to a class so-called (Ѕ 4 PR)} [20,21,30], to compute emptiable minimal or maximal siphons in marked Petri nets. These contributions have Petri Nets as a powerful modeling tool for the components of FMS that have been successfully used for such analyses.…”

Section: Introductionmentioning

confidence: 99%