New reachability trees for unbounded Petri nets

Wang, Shouguang; Zhou, MengChu; Gan, MengDi; You, Dan; Li, Yue

doi:10.1109/icra.2015.7139737

Cited by 11 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…5, where 35 nodes including 23 ω-nodes and 12 ordinary nodes. A reduced one called ωRT is still big and up to 20 nodes including 16 ω-nodes and 4 ordinary ones [20]. The LRT of the net is also shown in Fig.…”

Section: A Tree Generation and Sizementioning

confidence: 98%

See 1 more Smart Citation

Lean reachability tree for Petri net analysis

Zhou

2016

2016 IEEE 13th International Conference on Networking, Sensing, and Control (ICNSC)

Self Cite

View full text Add to dashboard Cite

This work presents a non-Karp-Miller tree called a lean reachability tree (LRT). It does not try to equivalently represent but faithfully express in a finite manner the reachability set of an unbounded Petri net. First, we derive a sufficient and necessary condition of unbounded places and some incremental reachability properties to characterize unbounded nets. Then, we present a sufficiently enabling condition (SEC) and an LRT generation algorithm. No fake marking is produced and no legal marking is lost during the tree generation. We prove that LRT can represent faithfully the reachability set of an unbounded net in a finite manner. Also, we examine its properties and prove a sufficient condition for deadlock checking based on it. Our examples show that LRT outperforms the latest modified Karp-Miller trees in terms of size, expressiveness, and applicability.

show abstract

Section: A Tree Generation and Sizementioning

confidence: 98%

“…Based on NMRT, a reduced tree for ω-independent nets, called ωRT, is proposed in [18], [19] to remove two types of duplicate nodes. Further, Wang, et al, [20] present a new reachability tree (NRT) by adding the superscripts to ω to decompose the contribution of different transitions to a marking component. NRT is then renamed as AωRT.…”

Section: Introductionmentioning

confidence: 99%

Lean reachability tree for Petri net analysis

Zhou

2016

2016 IEEE 13th International Conference on Networking, Sensing, and Control (ICNSC)

Self Cite

View full text Add to dashboard Cite

show abstract

“…For unbounded Petri nets, there exist infinite reachable states. RT [5][6][7] can represent an unbounded Petri net by introducing a special symbol v, to represent an infinite component in states. However, there exists the problem of reachability information loss caused by the usage of v. RG cannot describe the complete behavior of an unbounded Petri net in a finite structure.…”

Section: Introductionmentioning

confidence: 99%

Combinatorics and resource circuit–based enumeration of reachable states for S³PR

Hong

Wang

Jing

et al. 2016

Advances in Mechanical Engineering

View full text Add to dashboard Cite

Reachability graphs can accurately reflect the state information of bounded Petri nets. However, the complexity of reachability graphs generation is exponential, which makes time waste and sometimes the computation may stop midway after a long time due to exhausted memory. Hence, this work presents combinatorics and resource circuit-based method to estimate the number of reachable states for a class of Petri nets-S 3 PR. First, by combinatorics, an upper bound of reachable states of an S 3 PR can be calculated. The upper bound is the sum of reachable states and unreachable states. Hence, the next step is to obtain the number of unreachable states. By analysis, it is found that there exists a close relationship between resource circuits and the unreachable states. Therefore, the number of unreachable states of an S 3 PR can be found by extracting all the resource circuits. Finally, the resulting number of subtracting the number of unreachable states from the upper bound is the expected result. In addition, example calculation and analysis are given to show the effectiveness of the proposed method.

show abstract

A perspective on Petri Net learning

Qi,

Jiang

2023

Front. Comput. Sci.

View full text Add to dashboard Cite

New reachability trees for unbounded Petri nets

Cited by 11 publications

References 10 publications

Lean reachability tree for Petri net analysis

Lean reachability tree for Petri net analysis

Combinatorics and resource circuit–based enumeration of reachable states for S³PR

A perspective on Petri Net learning

Contact Info

Product

Resources

About

New reachability trees for unbounded Petri nets

Cited by 11 publications

References 10 publications

Lean reachability tree for Petri net analysis

Lean reachability tree for Petri net analysis

Combinatorics and resource circuit–based enumeration of reachable states for S3PR

A perspective on Petri Net learning

Contact Info

Product

Resources

About

Combinatorics and resource circuit–based enumeration of reachable states for S³PR