Synthesis of live and bounded persistent systems

DOI10.3233/FI-2015-1244zbMATH Open1335.68164OpenAlexW1873178187MaRDI QIDQ2803576FDOQ2803576

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

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)

Cited In (10)

• Reduction and synthesis of live and bounded free choice Petri nets
• Title not available (Why is that?)
• Bounded choice-free Petri net synthesis: algorithmic issues
• Synthesis of Petri nets with restricted place-environments: classical and parameterized
• A New Property of Choice-Free Petri Net Systems
• An extension of the taxonomy of persistent and nonviolent steps
• Title not available (Why is that?)
• Synthesis of Persistent Systems
• Characterisation of the state spaces of marked graph Petri nets
• Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues

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)