Characterising Petri net solvable binary words

DOI10.1007/978-3-319-39086-4_4zbMATH Open1346.68127OpenAlexW2486372688MaRDI QIDQ2822650FDOQ2822650

Authors: Eike Best, Evgeny Erofeev, Uli Schlachter, Harro Wimmel 

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

Recommendations

• Conditions for Petri net solvable binary words
• An efficient characterization of Petri net solvable binary words
• Generating all minimal Petri net unsolvable binary words
• On the Petri net realization of context-free graphs
• Structurally cyclic Petri nets

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)

Cites Work

• Understanding Petri Nets
• Properties of Conflict-Free and Persistent Petri Nets
• Synthesis of bounded choice-free Petri nets
• Characterisation of the state spaces of live and bounded marked graph Petri nets
• Petri net synthesis
• Conditions for Petri net solvable binary words

Cited In (6)

• Target-oriented Petri net synthesis
• Presynthesis of bounded choice-free or fork-attribution nets
• Conditions for Petri net solvable binary words
• Bounded choice-free Petri net synthesis: algorithmic issues
• Generating all minimal Petri net unsolvable binary words
• An efficient characterization of Petri net solvable binary words

Uses Software

• APT
• GitHub

This page was built for publication: Characterising Petri net solvable binary words

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