Synthesis of Persistent Systems

  • Eike Best
  • Raymond Devillers
Conference paper

DOI: 10.1007/978-3-319-07734-5_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8489)
Cite this paper as:
Best E., Devillers R. (2014) Synthesis of Persistent Systems. In: Ciardo G., Kindler E. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2014. Lecture Notes in Computer Science, vol 8489. Springer, Cham

Abstract

This paper presents efficient, specialised synthesis and reengineering algorithms for the case that a transition system is finite, persistent and reversible. It also shows by means of a complex example that structural properties of the synthesised Petri nets may not necessarily be entailed.

Keywords

Cyclic Behaviour Persistency Labelled Transition Systems Parikh Vectors Petri Nets Region Theory System Synthesis Reengineering 

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 OldenburgGermany
  2. 2.Département d’InformatiqueUniversité Libre de BruxellesBelgium

Personalised recommendations