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

DOI10.1007/978-3-319-04921-2_13zbMath1362.68200OpenAlexW1606055572MaRDI QIDQ5404909

Raymond Devillers, Eike Best

Publication date: 31 March 2014

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04921-2_13

zbMATH Keywords

Petri netstransition systemssystem synthesisregion theory

Mathematics Subject Classification ID

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

Related Items (15)

Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues ⋮ A New Property of Choice-Free Petri Net Systems ⋮ Articulation of Transition Systems and Its Application to Petri Net Synthesis ⋮ Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets ⋮ Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems ⋮ Characterisation of the state spaces of marked graph Petri nets ⋮ Synthesis of Persistent Systems ⋮ Synthesis and reengineering of persistent systems ⋮ Characterising Petri Net Solvable Binary Words ⋮ The Power of Prime Cycles ⋮ Petri Net Synthesis for Restricted Classes of Nets ⋮ State space axioms for T-systems ⋮ Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis ⋮ Synthesis of (choice-free) reset nets

This page was built for publication: Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets