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