Characterising Petri net solvable binary words

DOI10.1007/978-3-319-39086-4_4MaRDI QIDQ2822650zbMATHOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(6)

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

Describes a project that uses

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)