Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets

  • Eike Best
  • Raymond Devillers
Conference paper

DOI: 10.1007/978-3-319-04921-2_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8370)
Cite this paper as:
Best E., Devillers R. (2014) Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets. In: Dediu AH., Martín-Vide C., Sierra-Rodríguez JL., Truthe B. (eds) Language and Automata Theory and Applications. LATA 2014. Lecture Notes in Computer Science, vol 8370. Springer, Cham

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.

Keywords

Petri nets region theory system synthesis transition systems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Eike Best
    • 1
  • Raymond Devillers
    • 2
  1. 1.Department of Computing ScienceCarl von Ossietzky Universität OldenburgOldenburgGermany
  2. 2.Département d’InformatiqueUniversité Libre de BruxellesBruxellesBelgium

Personalised recommendations