Reachability in Live and Safe Free-Choice Petri Nets is NP-complete
The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is polynomial. We show that this is unlikely: the problem is NP-complete.
Free-Choice Petri nets; Reachability; NP-completeness