Generating all minimal Petri net unsolvable binary words

DOI10.1016/J.DAM.2019.04.023MaRDI QIDQ2295623zbMATHOpenAlexWikidataFDO

Authors Evgeny Erofeev, Kamila Barylska, Łukasz Mikulski, Marcin Piatkowski

Publication date 14 February 2020

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2019.04.023

zbMATH Keywords

synthesisPetri netbinary wordlabelled transition system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15) 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
• Characterising Petri net solvable binary words
• A complexity characteristic of Petri net languages
• Uniqueness of minimal 1-safe Petri net generating all the binary \(n\)-vectors as its marking vectors exactly once

Cites work

• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
• Characterising Petri net solvable binary words
• Conditions for Petri net solvable binary words
• From Petri nets to automata with concurrency
• Introduction to algorithms.
• Repetitions in strings: algorithms and combinatorics
• Understanding Petri Nets

Cited in

(5)

• Conditions for Petri net solvable binary words
• An efficient characterization of Petri net solvable binary words
• Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
• Characterising Petri net solvable binary words
• Target-oriented Petri net synthesis

This page was built for publication: Generating all minimal Petri net unsolvable binary words

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