Number of reachable states for simple classes of Petri nets
Daniel Yuh Chao, Fang Yu · 2011
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.