Flat Parametric Counter Automata

In this paper we study the reachability problem for parametric flat counter automata, in relation with the satisfiability problem of three fragments of integer arithmetic. The equivalence between non-parametric flat counter automata and Presburger arithmetic has been established previously by Comon and Jurski. We simplify their proof by introducing finite state automata defined over alphabets of a special kind of graphs (zigzags). This framework allows one to express also the reachability problem for parametric automata with one control loop as the satisfiability of a 1-parametric linear Diophantine systems. The latter problem is shown to be decidable, using a number-theoretic argument. In general, the reachability problem for parametric flat counter automata with more than one loops is shown to be undecidable, by reduction from Hilbert's Tenth Problem. Finally, we study the relation between flat counter automata, integer arithmetic, and another important class of computational devices, namely the 2-way reversal bounded counter machines.

[1]  Ju. V. Matijasevic,et al.  ENUMERABLE SETS ARE DIOPHANTINE , 2003 .

[2]  Alain Finkel,et al.  How to Compose Presburger-Accelerations: Applications to Broadcast Protocols , 2002, FSTTCS.

[3]  H IbarraOscar.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978 .

[4]  Tao Jiang,et al.  New Decidability Results Concerning Two-Way Counter Machines , 1995, SIAM J. Comput..

[5]  Tao Jiang,et al.  New Decidability Results Concerning Two-way Counter Machines and Applications , 1993, ICALP.

[6]  Véronique Cortier,et al.  Flatness Is Not a Weakness , 2000, CSL.

[7]  Ahmed Bouajjani,et al.  TReX: A Tool for Reachability Analysis of Complex Systems , 2001, CAV.

[8]  T. Pheidas,et al.  Undecidability of existential theories of rings and fields: a survey. , 2000 .

[9]  Oscar H. Ibarra,et al.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[10]  Hubert Comon-Lundh,et al.  Multiple Counters Automata, Safety Analysis and Presburger Arithmetic , 1998, CAV.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  J. Barkley Rosser,et al.  Extensions of some theorems of Gödel and Church , 1936, Journal of Symbolic Logic.

[13]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[14]  Pascal Lafourcade,et al.  Intruder Deduction for AC-Like Equational Theories with Homomorphisms , 2005, RTA.

[15]  Loïc Pottier.  Solutions minimales des systemes diophantiens lineaires : bornes et algorithmes , 1990 .

[16]  Laure Petrucci,et al.  FAST: Fast Acceleration of Symbolikc Transition Systems , 2003, CAV.

[17]  Eitan M. Gurari,et al.  Two-Way Counter Machines and Diophantine Equations , 1982, JACM.

[18]  Pierre Wolper,et al.  Verifying Systems with Infinite but Regular State Spaces , 1998, CAV.

[19]  Antonín Kucera,et al.  Efficient Verification Algorithms for One-Counter Processes , 2000, ICALP.

[20]  Stéphane Demri,et al.  The Effects of Bounding Syntactic Resources on Presburger LTL , 2007, 14th International Symposium on Temporal Representation and Reasoning (TIME'07).

[21]  Sandy Irani,et al.  Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems , 1999, DAC '99.

[22]  Faron Moller,et al.  DP lower bounds for equivalence-checking and model-checking of one-counter automata , 2004, Inf. Comput..

[23]  Bernard Boigelot,et al.  On iterating linear transformations over recognizable sets of integers , 2003, Theor. Comput. Sci..

[24]  S. Ginsburg,et al.  Semigroups, Presburger formulas, and languages. , 1966 .

[25]  Grégoire Sutre,et al.  Flat Counter Automata Almost Everywhere! , 2005, ATVA.

[26]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[27]  Thomas A. Henzinger,et al.  Parametric real-time reasoning , 1993, STOC.

[28]  A. Church.  An Unsolvable Problem of Elementary Number Theory , 1936 .

[29]  Journal of the Association for Computing Machinery , 1961, Nature.

[30]  Oscar H. Ibarra,et al.  On the solvability of a class of diophantine equations and applications , 2006, Theor. Comput. Sci..

[31]  Oscar H. Ibarra,et al.  A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems , 2003, ICALP.

[32]  L. Lipshitz.  The Diophantine problem for addition and divisibility , 1978 .

[33]  Grégoire Sutre,et al.  On Flatness for 2-Dimensional Vector Addition Systems with States , 2004, CONCUR.

[34]  K. Gödel.  Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I , 1931 .

[35]  Parosh Aziz Abdulla,et al.  Simulation Is Decidable for One-Counter Nets (Extended Abstract) , 1998, CONCUR.

[36]  K. Gödel.  Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I , 1931 .