![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Chiola G. Dutheillet C. Franceschinis G. Haddad S.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.176, Iss.1, 1997-04, pp. : 39-65
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Reachability in live and safe free-choice Petri nets is NP-complete
By Esparza J.
Theoretical Computer Science, Vol. 198, Iss. 1, 1998-05 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)