An efficient characterization of Petri net solvable binary words
From MaRDI portal
Publication:2280188
DOI10.1007/978-3-319-91268-4_11zbMath1427.68189OpenAlexW2801591860WikidataQ104379649 ScholiaQ104379649MaRDI QIDQ2280188
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
Combinatorics on words (68R15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (4)
Reversing Steps in Petri Nets ⋮ Target-oriented Petri Net Synthesis ⋮ Acyclic and Cyclic Reversing Computations in Petri Nets ⋮ Investigating Reversibility of Steps in Petri Nets
This page was built for publication: An efficient characterization of Petri net solvable binary words
