Synthesis of live and bounded persistent systems

DOI10.3233/FI-2015-1244MaRDI QIDQ2803576zbMATH OpenOpenAlexFDO

Authors Eike Best, Raymond Devillers

Publication date 2 May 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2015-1244

zbMATH Keywords

persistencePetri netslivenesslabelled transition systemsParikh vectorssystem synthesisregion theorycyclic behaviour

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Synthesis of Persistent Systems
• Synthesis of bounded choice-free Petri nets
• Liveness and boundedness analysis of Petri net synthesis
• Synthesis and reengineering of persistent systems
• Bounded choice-free Petri net synthesis: algorithmic issues

Cited in

(13)

• Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
• A new property of choice-free Petri net systems
• Theory and Applications of Models of Computation
• Synthesis of bounded choice-free Petri nets
• Synthesis and reengineering of persistent systems
• Reduction and synthesis of live and bounded free choice Petri nets
• scientific article; zbMATH DE number 2112363 (Why is no real title available?)
• Bounded choice-free Petri net synthesis: algorithmic issues
• Synthesis of Petri nets with restricted place-environments: classical and parameterized
• An extension of the taxonomy of persistent and nonviolent steps
• scientific article; zbMATH DE number 3938576 (Why is no real title available?)
• Synthesis of Persistent Systems
• Characterisation of the state spaces of marked graph Petri nets

This page was built for publication: Synthesis of live and bounded persistent systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803576)