A new reachability tree for unbounded Petri nets

Abstract

Petri nets can be viewed as graphical models and mathematical tools to study discrete event system. As a basic analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics. In this paper, a new reachability tree for unbounded generalized Petri nets is proposed. This new method can decrease the number of nodes in the new reachability tree besides avoidance of some spurious markings which appear in other reachability trees. Several examples are provided to illustrate its superiority.