Synthesis of Live and Bounded Persistent Systems

DOI10.3233/FI-2015-1244zbMath1335.68164OpenAlexW1873178187MaRDI QIDQ2803576

Raymond Devillers, Eike Best

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

livenesspersistencePetri netslabelled 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)

Related Items (6)

Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ A New Property of Choice-Free Petri Net Systems ⋮ Characterisation of the state spaces of marked graph Petri nets ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ An extension of the taxonomy of persistent and nonviolent steps ⋮ Synthesis of Petri nets with restricted place-environments: classical and parameterized

This page was built for publication: Synthesis of Live and Bounded Persistent Systems