Characterising Petri Net Solvable Binary Words

DOI10.1007/978-3-319-39086-4_4zbMath1346.68127OpenAlexW2486372688MaRDI QIDQ2822650

Uli Schlachter, Eike Best, Harro Wimmel, Evgeny Erofeev

Publication date: 4 October 2016

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-319-39086-4_4

zbMATH Keywords

synthesisPetri netslabelled transition systemsbinary words

Mathematics Subject Classification ID

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

Related Items (5)

Bounded choice-free Petri net synthesis: algorithmic issues ⋮ Generating all minimal Petri net unsolvable binary words ⋮ Presynthesis of bounded choice-free or fork-attribution nets ⋮ Target-oriented Petri Net Synthesis ⋮ Conditions for Petri Net Solvable Binary Words

Uses Software

• GitHub
• APT

Cites Work

• Petri net synthesis
• Properties of Conflict-Free and Persistent Petri Nets
• Understanding Petri Nets
• Conditions for Petri Net Solvable Binary Words
• Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets
• Unnamed Item

This page was built for publication: Characterising Petri Net Solvable Binary Words