Articulation of Transition Systems and Its Application to Petri Net Synthesis

DOI10.1007/978-3-030-21571-2_8OpenAlexW2949187135MaRDI QIDQ6144210

Raymond Devillers

Publication date: 29 January 2024

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-21571-2_8

zbMATH Keywords

decompositioncompositionlabelled transition systemsPetri net synthesis

Mathematics Subject Classification ID

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

Related Items (1)

Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis

Cites Work

• Unnamed Item
• Unnamed Item
• Petri net synthesis
• Maintaining bridge-connected and biconnected components on-line
• The synthesis problem for elementary net systems is NP-complete
• Over-approximative Petri net synthesis for restricted subclasses of nets
• Factorisation of transition systems
• Bounded choice-free Petri net synthesis: algorithmic issues
• The box algebra = Petri nets + process expressions
• Factorisation of Petri net solvable transition systems
• Petri Net Distributability
• Simultaneous Petri Net Synthesis
• Polynomial algorithms for the synthesis of bounded nets
• Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets

This page was built for publication: Articulation of Transition Systems and Its Application to Petri Net Synthesis