Flat Parametric Counter Automata
From MaRDI portal
Publication:5901227
DOI10.1007/11787006_49zbMath1134.68028OpenAlexW2132083063MaRDI QIDQ5901227
Marius Bozga, Yassine Lakhneche, Radu Iosif
Publication date: 11 September 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11787006_49
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items
On the solvability of a class of Diophantine equations and applications ⋮ Algebraic program analysis ⋮ Reachability in Succinct and Parametric One-Counter Automata ⋮ Optimal and robust controller synthesis using energy timed automata with uncertainty ⋮ Verification of qualitative \(\mathbb Z\) constraints ⋮ Automatic Verification of Counter Systems With Ranking Function ⋮ Dense-choice counter machines revisited ⋮ Optimal and robust controller synthesis. Using energy timed automata with uncertainty ⋮ Iterating Octagons ⋮ Acceleration in Convex Data-Flow Analysis ⋮ Automata-Based Termination Proofs ⋮ Decision Problems for Finite Automata over Infinite Algebraic Structures ⋮ Flat Petri nets (invited talk)
Uses Software