Flat Parametric Counter Automata

  title={Flat Parametric Counter Automata},
  author={Marius Bozga and Radu Iosif and Yassine Lakhnech},
In this paper we study the reachability problem for parametr ic flat counter automata, in relation with the satisfiability probl em of three fragments of integer arithmetic. The equivalence between non-parame tric flat counter automata and Presburger arithmetic has been established prev iously by Comon and Jurski [5]. We simplify their proof by introducing finite sta te automata defined over alphabets of a special kind of graphs (zigzags). This fr amework allows one to express also the… CONTINUE READING
Highly Cited
This paper has 68 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 44 extracted citations

An Efficient Algorithm for the Computation of Optimum Paths in Weighted Graphs

Marius. Bozga, Radu. Iosif, Vassiliki. Sfyrla
View 5 Excerpts
Highly Influenced

Decision Procedures for Flat Array Properties

Journal of Automated Reasoning • 2014
View 2 Excerpts
Highly Influenced

Automatic Verification of Counter Systems With Ranking Function

Electr. Notes Theor. Comput. Sci. • 2009
View 3 Excerpts
Highly Influenced

69 Citations

Citations per Year
Semantic Scholar estimates that this publication has 69 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 23 references

Mathematische probleme. Vortrag, gehalten a uf dem internationalen Mathematiker-Kongress zu Paris

D. Hilbert
In Nachrichten von der Königliche Gesellschaft der Wissenschaften zu Göttingen • 1900
View 6 Excerpts
Highly Influenced

Fast: Fas t accelereation of symbolic transition systems

S. Bardin, A. Finkel, J. Leroux, L. Petrucci
InProc. TACAS, • 2004
View 2 Excerpts

Similar Papers

Loading similar papers…