Author： Berthomieu Bernard Lime Didier Roux Olivier Vernadat François
Publisher： Springer Publishing Company
ISSN： 0924-6703
Source： Discrete Event Dynamic Systems, Vol.17, Iss.2, 2007-06, pp. : 133-158
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
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. :
Access to resources
Recommend
On the composition of time Petri nets
Discrete Event Dynamic Systems, Vol. 21, Iss. 3, 2011-09 ,pp. :
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. :