108
click to vote
FSTTCS
1993
Springer
15 years 7 months ago
1993
Springer
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 f...