Sciweavers

TCS
1998
13 years 11 months ago
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...
Javier Esparza