A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Complexity Results for 1-safe Nets
1993
DAIMI Report Series
<p>We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete for 1-safe nets. We also prove that deadlock is NP-complete for free-choice nets and for 1-safe free-choice nets. Finally, we prove that for arbitrary Petri nets, deadlock is equivalent to reachability and liveness.</p><p> </p><p>This paper is to be presented at FST & TCS, Foundations of Software Technology &
doi:10.7146/dpb.v22i455.6773
fatcat:kxvraxqzmbd67ps5uuch7bfsqy