A Sufficient Condition for Reachability in a General Petri Net

Author： Ramachandran Parthasarathy   Kamath Manjunath  

Publisher： Springer Publishing Company

ISSN： 0924-6703

Source： Discrete Event Dynamic Systems, Vol.14, Iss.3, 2004-07, pp. : 251-266

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

Related content

A symbolic reachability graph for coloured petri nets

By Chiola G.   Dutheillet C.   Franceschinis G.   Haddad S.  

Theoretical Computer Science, Vol. 176, Iss. 1, 1997-04 ,pp. : 39-65

Elsevier

Access to resources Recommend Favorite

Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches

By Berthomieu Bernard   Lime Didier   Roux Olivier   Vernadat François  

Discrete Event Dynamic Systems, Vol. 17, Iss. 2, 2007-06 ,pp. : 133-158

Springer Publishing Company

Access to resources Recommend Favorite

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. : 211-224

Elsevier

Access to resources Recommend Favorite

Reachability analysis of logic Petri nets using incidence matrix

By Du Yu Yue   Ning Yu Hui   Qi Liang  

Enterprise Information Systems, Vol. 8, Iss. 6, 2014-11 ,pp. : 630-647

Taylor & Francis Ltd

Access to resources Recommend Favorite

Automatic generation of ladder diagram with control Petri Net

By Lee Gi Bum   Zandong Han   Lee Jin S.  

Journal of Intelligent Manufacturing, Vol. 15, Iss. 2, 2004-04 ,pp. : 245-252

Springer Publishing Company

Access to resources Recommend Favorite