An Algorithm of Recognizing Unbounded Petri Nets With Semilinear Reachability Sets and Constructing Their Reachability Trees | Zendy

Dan You | Zendy; Shouguang Wang | Zendy; Wenhui Wu | Zendy

Open Access

An Algorithm of Recognizing Unbounded Petri Nets With Semilinear Reachability Sets and Constructing Their Reachability Trees

Author(s) -

Dan You,

Shouguang Wang,

Wenhui Wu

Publication year - 2018

Publication title -

ieee access

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.587

H-Index - 127

ISSN - 2169-3536

DOI - 10.1109/access.2018.2861467

Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation

Reachability is one of the significant properties of Petri nets (PNs). For unbounded PNs, how to determine their reachability is an open issue. In this paper, we propose an algorithm that determines whether the reachability set of an unbounded PN is semilinear. Moreover, in the case that the unbounded PN has semilinear reachability set, the proposed algorithm can construct a new reachability tree (NRT) that exactly characterizes its reachability set. In addition, it can be decided based on NRT whether an unbounded PN suffers from deadlocks. The results are illustrated via examples.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research