Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have