Reachability in live and safe free-choice Petri nets is NP-complete

Author: Esparza J.  

Publisher: Elsevier

ISSN: 0304-3975

Source: Theoretical Computer Science, Vol.198, Iss.1, 1998-05, pp. : 211-224

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract