Sciweavers

73
Voted
FSTTCS
1993
Springer
15 years 28 days ago
Complexity Results for 1-safe Nets
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...
Allan Cheng, Javier Esparza, Jens Palsberg