Characterisation of the state spaces of live and bounded marked graph Petri nets

DOI10.1007/978-3-319-04921-2_13MaRDI QIDQ5404909zbMATH OpenOpenAlexFDO

Authors Eike Best, Raymond Devillers

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)

Recommendations

• Characterisation of the state spaces of marked graph Petri nets
• scientific article; zbMATH DE number 512821
• Reachability in cyclic extended free-choice systems
• Sufficient conditions for the marked graph realisability of labelled transition systems
• Analysis and synthesis of net structures and transition graphs

Cited in

(18)

• scientific article; zbMATH DE number 5079405 (Why is no real title available?)
• scientific article; zbMATH DE number 3872693 (Why is no real title available?)
• Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues
• Articulation of Transition Systems and Its Application to Petri Net Synthesis
• Synthesis of (choice-free) reset nets
• Characterising Petri net solvable binary words
• Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
• Petri Net Synthesis for Restricted Classes of Nets
• Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets
• State space axioms for T-systems
• Synthesis of Persistent Systems
• Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems
• Plain, bounded, reversible, persistent, and \(k\)-marked Petri nets have marked graph reachability graphs
• Characterisation of the state spaces of marked graph Petri nets
• Synthesis and reengineering of persistent systems
• The power of prime cycles
• Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
• A new property of choice-free Petri net systems

This page was built for publication: Characterisation of the state spaces of live and bounded marked graph Petri nets

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