Generating all minimal Petri net unsolvable binary words

DOI10.1016/J.DAM.2019.04.023zbMATH Open1434.68244OpenAlexW2946758498WikidataQ104379605 ScholiaQ104379605MaRDI QIDQ2295623FDOQ2295623

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

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

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)

Cites Work

• Introduction to algorithms.
• Understanding Petri Nets
• Repetitions in strings: algorithms and combinatorics
• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
• From Petri nets to automata with concurrency
• Characterising Petri Net Solvable Binary Words
• Conditions for Petri Net Solvable Binary Words

Cited In (2)

• Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
• 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)