Reachability in live and safe free-choice Petri nets is NP-complete
Author:
- Javier EsparzaJEJavier Esparza
- 30 May 1998
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 198 (1-2) , 211-224
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Reachability in cyclic extended free-choice systemsTheoretical Computer Science, 1993
- A polynomial-time algorithm to decide liveness of bounded free choice netsTheoretical Computer Science, 1992