The emptiness problem for valence automata or: another decidable extension of Petri nets
From MaRDI portal
Publication:1675163
DOI10.1007/978-3-319-24537-9_15zbMath1471.68123OpenAlexW2403397537MaRDI QIDQ1675163
Publication date: 27 October 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-24537-9_15
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (4)
The emptiness problem for valence automata over graph monoids ⋮ Coverability and Termination in Recursive Petri Nets ⋮ Coverability, Termination, and Finiteness in Recursive Petri Nets ⋮ Characterization and complexity results on jumping finite automata
This page was built for publication: The emptiness problem for valence automata or: another decidable extension of Petri nets
