A reduced reachability tree for a class of unbounded petri nets

Document Type

Article

Publication Date

10-10-2015

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.

Identifier

84945184468 (Scopus)

Publication Title

IEEE Caa Journal of Automatica Sinica

External Full Text Location

https://doi.org/10.1109/JAS.2015.7296528

e-ISSN

23299274

ISSN

23299266

First Page

345

Last Page

352

Issue

4

Volume

2

Grant

61374005

This document is currently not available here.

Share

COinS