A reduced reachability tree for a class of unbounded petri nets

Shouguang Wang; Mengdi Gan; Mengchu Zhou; Dan You

doi:10.1109/JAS.2015.7296528

A reduced reachability tree for a class of unbounded petri nets

Shouguang Wang, Mengdi Gan, Mengchu Zhou, Dan You

Research output: Contribution to journal › Article › peer-review

36 Scopus citations

Abstract

As a powerful analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics such as boundedness, liveness and reversibility. This work proposes a method to generate a reachability tree, called ωRT for short, for a class of unbounded generalized nets called ω-independent nets based on new modified reachability trees (NMRTs). ωRT can effectively decrease the number of nodes by removing duplicate and ω-duplicate nodes in the tree, and verify properties such as reachability, liveness and deadlocks. Two examples are provided to show its superiority over NMRTs in terms of tree size.

Original language	English (US)
Article number	7296528
Pages (from-to)	345-352
Number of pages	8
Journal	IEEE/CAA Journal of Automatica Sinica
Volume	2
Issue number	4
DOIs	https://doi.org/10.1109/JAS.2015.7296528
State	Published - Oct 10 2015
Externally published	Yes

All Science Journal Classification (ASJC) codes

Control and Optimization
Artificial Intelligence
Information Systems
Control and Systems Engineering

Keywords

Petri nets
deadlock
reachability tree

Access to Document

10.1109/JAS.2015.7296528

Cite this

@article{d7f2c2b028e247a1b60b19949428723a,

title = "A reduced reachability tree for a class of unbounded petri nets",

abstract = "As a powerful analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics such as boundedness, liveness and reversibility. This work proposes a method to generate a reachability tree, called ωRT for short, for a class of unbounded generalized nets called ω-independent nets based on new modified reachability trees (NMRTs). ωRT can effectively decrease the number of nodes by removing duplicate and ω-duplicate nodes in the tree, and verify properties such as reachability, liveness and deadlocks. Two examples are provided to show its superiority over NMRTs in terms of tree size.",

keywords = "Petri nets, deadlock, reachability tree",

author = "Shouguang Wang and Mengdi Gan and Mengchu Zhou and Dan You",

note = "Publisher Copyright: {\textcopyright} 2014 Chinese Association of Automation.",

year = "2015",

month = oct,

day = "10",

doi = "10.1109/JAS.2015.7296528",

language = "English (US)",

volume = "2",

pages = "345--352",

journal = "IEEE/CAA Journal of Automatica Sinica",

issn = "2329-9266",

publisher = "IEEE Advancing Technology for Humanity",

number = "4",

}

TY - JOUR

T1 - A reduced reachability tree for a class of unbounded petri nets

AU - Wang, Shouguang

AU - Gan, Mengdi

AU - Zhou, Mengchu

AU - You, Dan

PY - 2015/10/10

Y1 - 2015/10/10

N2 - As a powerful analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics such as boundedness, liveness and reversibility. This work proposes a method to generate a reachability tree, called ωRT for short, for a class of unbounded generalized nets called ω-independent nets based on new modified reachability trees (NMRTs). ωRT can effectively decrease the number of nodes by removing duplicate and ω-duplicate nodes in the tree, and verify properties such as reachability, liveness and deadlocks. Two examples are provided to show its superiority over NMRTs in terms of tree size.

AB - As a powerful analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics such as boundedness, liveness and reversibility. This work proposes a method to generate a reachability tree, called ωRT for short, for a class of unbounded generalized nets called ω-independent nets based on new modified reachability trees (NMRTs). ωRT can effectively decrease the number of nodes by removing duplicate and ω-duplicate nodes in the tree, and verify properties such as reachability, liveness and deadlocks. Two examples are provided to show its superiority over NMRTs in terms of tree size.

KW - Petri nets

KW - deadlock

KW - reachability tree

UR - http://www.scopus.com/inward/record.url?scp=84945184468&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84945184468&partnerID=8YFLogxK

U2 - 10.1109/JAS.2015.7296528

DO - 10.1109/JAS.2015.7296528

M3 - Article

AN - SCOPUS:84945184468

SN - 2329-9266

VL - 2

SP - 345

EP - 352

JO - IEEE/CAA Journal of Automatica Sinica

JF - IEEE/CAA Journal of Automatica Sinica

IS - 4

M1 - 7296528

ER -

A reduced reachability tree for a class of unbounded petri nets

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this