A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Complexity results for 1-safe nets
1995
Theoretical Computer Science
We study the complexity of several standard problems for l-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete for l-safe nets. We also prove that deadlock is NP-complete for free-choice nets and for l-safe free-choice nets. Finally, we prove that for arbitrary Petri nets, deadlock is equivalent to reachability and liveness. . 'Work done while this author was at the University of Edinburgh. 0304-3975/95/%09.50 0 1995-Elsevier
doi:10.1016/0304-3975(94)00231-7
fatcat:tgp7u5pvhze4fbyupzvbj72yau