The search functionality is under construction.
The search functionality is under construction.

Reachability Criterion for Petri Nets with Known Firing Count Vectors

Tadashi MATSUMOTO, Yasushi MIYANO

  • Full Text Views

    0

  • Cite this

Summary :

A formal necessary and sufficient condition on the general Petri net reachability problem is presented by eliminating all spurious solutions among known nonnegative integer solutions of state equation and unifying all the causes of those spurious solutions into a maximal-strongly-connected and siphon-and-trap subnet Nw. This result is based on the decomposition of a given net (N, Mo) with Md and the concepts of "no immature siphon at the reduced initial marking Mwo" and "no immature trap at the reduced end marking Mwd" on Nw which are both extended from "no token-free siphon at the initial marking Mo" and "no token-free trap at the end marking Md" on N, respectively, which have been both effectively, explicitly or implicitly, used in the well-known fundamental and simple subclasses.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.4 pp.628-634
Publication Date
1998/04/25
Publicized
Online ISSN
DOI
Type of Manuscript
Special Section LETTER (Special Section on Concurrent Systems Technology)
Category

Authors

Keyword