Efficient reachability analysis of bounded petri nets using constraint programming
Thomas Bourdeaud’huy, Pascal Yim, S. Hanafi · 2005
In this paper, we consider the Petri net (PNs) reachability problem, which consists of finding transition firing sequences leading to a given target marking. We focus on bounded Petri nets for which we develop a correct and complete algorithm using the logical abstraction technique proposed by Benasser and Yim. We define for that the PN sequential depth parameter, which corresponds to the maximal number of transitions to fire in order to reach any marking of the reachability graph.