DMCA
Complexity results for 1-safe nets (1995)
Cached
Download Links
by
Allan Cheng
,
Javier Esparza
,
Jens Palsberg
| Venue: | Theoretical Computer Science |
| Citations: | 52 - 7 self |
BibTeX
@INPROCEEDINGS{Cheng95complexityresults,
author = {Allan Cheng and Javier Esparza and Jens Palsberg},
title = {Complexity results for 1-safe nets},
booktitle = {Theoretical Computer Science},
year = {1995},
pages = {326--337},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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. 1 Petri net classes Reachability Liveness Deadlock
