Title :
Number of reachable states for simple classes of Petri nets
Author :
Chao, Daniel Yuh ; Yu, Fang
Author_Institution :
Dept. of Manage. & Inf. Sci., Nat. Cheng Chi Univ., Taipei, Taiwan
Abstract :
The problem of computing the number of reachable states of arbitrary Petri nets without building reachability graphs has never been investigated before. This paper deals with a simple class of Petri nets, called marked graphs. We express and find the number of reachable states of a marked graph in an algebraic way, which is the first result of this problem as far as we know.
Keywords :
Petri nets; computational complexity; number theory; reachability analysis; NP-complete; algebraic way; arbitrary Petri nets; marked graphs; reachable states; Equations; Firing; Linear circuits; Mobile communication; Petri nets; Reachability analysis; System recovery; Marked Graphs; Petri Net; Reachable States;
Conference_Titel :
IECON 2011 - 37th Annual Conference on IEEE Industrial Electronics Society
Conference_Location :
Melbourne, VIC
Print_ISBN :
978-1-61284-969-0
DOI :
10.1109/IECON.2011.6119926
