scientific article
From MaRDI portal
Publication:2911620
DOI10.4230/LIPIcs.FSTTCS.2011.152zbMath1246.68161MaRDI QIDQ2911620
Mohamed Faouzi Atig, Pierre Ganty
Publication date: 31 August 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)
Related Items (10)
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension ⋮ Unnamed Item ⋮ The emptiness problem for valence automata over graph monoids ⋮ Interprocedural Reachability for Flat Integer Programs ⋮ Coverability and Termination in Recursive Petri Nets ⋮ Unnamed Item ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ Decidable models of integer-manipulating programs with recursive parallelism ⋮ On Petri Nets with Hierarchical Special Arcs ⋮ Coverability, Termination, and Finiteness in Recursive Petri Nets
This page was built for publication:
