Flat Parametric Counter Automata
From MaRDI portal
Publication:5902108
DOI10.3233/FI-2009-0044zbMath1189.03046OpenAlexW4214650869MaRDI QIDQ5902108
Radu Iosif, Marius Bozga, Yassine Lakhneche
Publication date: 23 June 2009
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2009-0044
reachabilitydecidabilityPresburger arithmeticcounter automatalinear Diophantine equations with one parameter
Formal languages and automata (68Q45) Decidability (number-theoretic aspects) (11U05) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (5)
Decision procedures for flat array properties ⋮ Unnamed Item ⋮ Forward Analysis and Model Checking for Trace Bounded WSTS ⋮ Taming past LTL and flat counter systems ⋮ Flat Petri nets (invited talk)
This page was built for publication: Flat Parametric Counter Automata
