An efficient characterization of Petri net solvable binary words

DOI10.1007/978-3-319-91268-4_11MaRDI QIDQ2280188zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Maciej Koutny, Łukasz Mikulski, David de Frutos Escrig

Publication date 18 December 2019

Full work available at URL https://doi.org/10.1007/978-3-319-91268-4_11

zbMATH Keywords

reversibilityPetri netbinary wordbinary transition systemword solvability

Mathematics Subject Classification ID

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

Recommendations

• Characterising Petri net solvable binary words
• Conditions for Petri net solvable binary words
• Generating all minimal Petri net unsolvable binary words
• Reachability in cyclic extended free-choice systems
• scientific article; zbMATH DE number 3892612

Cited in

(7)

• Target-oriented Petri net synthesis
• Conditions for Petri net solvable binary words
• Investigating reversibility of steps in Petri nets
• Acyclic and cyclic reversing computations in Petri nets
• Generating all minimal Petri net unsolvable binary words
• Characterising Petri net solvable binary words
• Reversing Steps in Petri Nets

This page was built for publication: An efficient characterization of Petri net solvable binary words

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