Skip to main content
Conference Proceedings

Characterisation of the state spaces of live and bounded marked graph Petri nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8370 LNCS 161-172
DOI: 10.1007/978-3-319-04921-2_13
31Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The structure of the reachability graph of a live and bounded marked graph Petri net is fully characterised. A dedicated synthesis procedure is presented which allows the net and its bounds to be computed from its reachability graph. © 2014 Springer International Publishing.

Author supplied keywords

Cite

CITATION STYLE

APA

Best, E., & Devillers, R. (2014). Characterisation of the state spaces of live and bounded marked graph Petri nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8370 LNCS, pp. 161–172). https://doi.org/10.1007/978-3-319-04921-2_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free