Flat Parametric Counter Automata

DOI10.3233/FI-2009-0044MaRDI QIDQ5902108zbMATH OpenOpenAlexFDO

Authors Marius Bozga, Radu Iosif, Yassine Lakhnech

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

zbMATH Keywords

counter automatadecidabilitylinear Diophantine equations with one parameterPresburger arithmeticreachability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05) Decidability (number-theoretic aspects) (11U05) Formal languages and automata (68Q45)

Recommendations

• Flat Parametric Counter Automata
• Reachability in Succinct and Parametric One-Counter Automata
• Automated Technology for Verification and Analysis
• On parametric timed automata and one-counter machines
• On two-way FA with monotonic counters and quadratic Diophantine equations

Cited in

(7)

• Flat Petri nets (invited talk)
• Taming past LTL and flat counter systems
• Decision procedures for flat array properties
• Forward analysis and model checking for trace bounded WSTS
• Reachability in Succinct and Parametric One-Counter Automata
• Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility
• Flat Parametric Counter Automata

This page was built for publication: Flat Parametric Counter Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902108)