A Heuristic Algorithm FSDC Based on Avoidance of Deadlock Components in Finding Legal Firing Sequences of Petri Nets

Taoka, Satoshi; Furusato, Shinji; Watanabe, Takahiro

doi:10.1007/3-540-44919-1_26

Cited by 9 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Giving firing priority to transitions whose firings have no effect on subsequent searching It has already been known in designing heuristic algorithms for MAX LFS that shortening computing time and sharpness of solutions are obtained by giving firing priority to transitions whose firing has no effect on subsequent searching of firing sequences (see [5]). We are going to incorporate this idea into solving MCP.…”

Section: B Excluding Transitions Whose Firings Do Not Change Markingsmentioning

confidence: 99%

See 1 more Smart Citation

Heuristic algorithms for the marking construction problem of Petri nets

Taoka

Watanabe

2010

Proceedings of 2010 IEEE International Symposium on Circuits and Systems

Self Cite

View full text Add to dashboard Cite

The marking construction problem (MCP) of Petri nets is defined as follows: "Given a Petri net N, an initial marking M i and a target marking M t , construct a marking that is closest to M t among those which can be reached from M i by firing transitions." MCP includes the well-known marking reachability problem of Petri nets. MCP is known to be NP-hard, and we propose two schemas of heuristic algorithms: (i) not using any algorithm for the maximum legal firing sequence problem (MAX LFS) or (ii) using an algorithm for MAX LFS. This paper proposes two algorithms: MCA for (i) and MC feideq a for (ii), and compares their capability based on computing experiments.

show abstract

Section: B Excluding Transitions Whose Firings Do Not Change Markingsmentioning

confidence: 99%

“…Any algorithm for finding a heuristic solution δ to MAX LFS is called a heuristic algorithm for LFS. See [4][5][6][7] for related results on LFS and MAX LFS.…”

Section: Introductionmentioning

confidence: 98%

Heuristic algorithms for the marking construction problem of Petri nets

Taoka

Watanabe

2010

Proceedings of 2010 IEEE International Symposium on Circuits and Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…In PN which are controllable only partially, an illegal state may be reachable from a legal one by firing of uncontrollable transitions (see e.g. [3,4,5,6,65,66,67,68,69,53,71,85]). Consequently, it is necessary to find more restrictive control policy which will enforce a subset of legal states, i.e.…”

Section: Further Research In the Futurementioning

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

“…For a Petri net with given initial and target markings M 0 and M and a combined T-invariant F, find a legal firing transition sequence. To find a legal firing transition sequence, or reachabiity path as defined in (4), known computational techniques can be used (Kostin, 2003;Taoka et al, 2003;Watanabe, 2000;Huang & Murata, 1998).…”

Section: Using Transition Invariants For Reachability Analysis Of Petmentioning

confidence: 99%

Using Transition Invariants for Reachability Analysis of Petri Nets

Kostin¹

2008

Petri Net, Theory and Applications

View full text Add to dashboard Cite

A Heuristic Algorithm FSDC Based on Avoidance of Deadlock Components in Finding Legal Firing Sequences of Petri Nets

Cited by 9 publications

References 9 publications

Heuristic algorithms for the marking construction problem of Petri nets

Heuristic algorithms for the marking construction problem of Petri nets

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

Using Transition Invariants for Reachability Analysis of Petri Nets

Contact Info

Product

Resources

About