A symbolic reachability graph for coloured petri nets

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.

Previous Menu Next

Abstract

Related content

Synthesis of AGVS by coloured-timed Petri nets

By Hsieh Suhua

International Journal of Computer Integrated Manufacturing, Vol. 11, Iss. 4, 1998-07 ,pp. : 334-346

Taylor & Francis Ltd

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

Attack trace generation of cryptographic protocols based on coloured Petri nets model

By Bai Yunli

International Journal of Wireless and Mobile Computing, Vol. 6, Iss. 1, 2013-04 ,pp. : 91-97

Inderscience Publishers

Access to resources Recommend Favorite