Over-approximative Petri net synthesis for restricted subclasses of nets

DOI10.1007/978-3-319-77313-1_23MaRDI QIDQ1647718zbMATH OpenOpenAlexFDO

Authors Uli Schlachter

Publication date 26 June 2018

Full work available at URL https://doi.org/10.1007/978-3-319-77313-1_23

zbMATH Keywords

Petri net propertiesPetri net synthesisregion theory

Mathematics Subject Classification ID

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

Recommendations

• Petri Net Synthesis for Restricted Classes of Nets
• Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results
• Overlapping decompositions and expansions of Petri nets
• scientific article; zbMATH DE number 512821
• The synthesis problem of Petri nets
• Synthesis of Petri nets with restricted place-environments: classical and parameterized
• A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
• Bounded choice-free Petri net synthesis: algorithmic issues
• Synthesis of Petri nets from finite partial languages
• The Complexity of Synthesis of b-Bounded Petri Nets

Cited in

(6)

• Synthesis of (choice-free) reset nets
• Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues
• Petri Net Synthesis for Restricted Classes of Nets
• Target-oriented Petri net synthesis
• Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
• Articulation of Transition Systems and Its Application to Petri Net Synthesis

Describes a project that uses

Uses Software

• APT

This page was built for publication: Over-approximative Petri net synthesis for restricted subclasses of nets

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