Least Significant Digit First Presburger Automata

Since 1969 \cite{C-MST69,S-SMJ77}, we know that any Presburger-definable set \cite{P-PCM29} (a set of integer vectors satisfying a formula in the first-order additive theory of the integers) can be represented by a state-based symbolic representation, called in this paper Finite Digit Vector Automata (FDVA). Efficient algorithms for manipulating these sets have been recently developed. However, the problem of deciding if a FDVA represents such a set, is a well-known hard problem first solved by Muchnik in 1991 with a quadruply-exponential time algorithm. In this paper, we show how to determine in polynomial time whether a FDVA represents a Presburger-definable set, and we provide in this positive case a polynomial time algorithm that constructs a Presburger-formula that defines the same set.

[1]  Hubert Comon-Lundh,et al.  Diophantine Equations, Presburger Arithmetic and Finite Automata , 1996, CAAP.

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

[3]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract) , 1995, SAS.

[4]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

[5]  C. Michaux,et al.  LOGIC AND p-RECOGNIZABLE SETS OF INTEGERS , 1994 .

[6]  Denis Lugiez.  From automata to semi-linear sets: a solution for polyhedra and even more general sets , 2004 .

[7]  Jérôme Leroux.  The Affine Hull of a Binary Automaton is Computable in Polynomial Time , 2003, INFINITY.

[8]  F. Klaedtke.  On the automata size for Presburger arithmetic , 2004, LICS 2004.

[9]  Andrei Voronkov,et al.  BRAIN : Backward Reachability Analysis with Integers , 2002, AMAST.

[10]  Pierre Wolper,et al.  On the Construction of Automata from Linear Arithmetic Constraints , 2000, TACAS.

[11]  David L. Dill,et al.  Deciding Presburger Arithmetic by Model Checking and Comparisons with Other Methods , 2002, FMCAD.

[12]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[13]  Laurent Fribourg,et al.  Petri Nets, Flat Languages and Linear Arithmetic , 2000, WFLP.

[14]  J. Leroux,et al.  Algorithmique de la vérification des systèmes à compteurs : approximation et accélération, implémentation de l'outil FAST , 2003 .

[15]  L. Latour.  From automata to formulas: convex integer polyhedra , 2004, LICS 2004.

[16]  Andrej Muchnik.  The definable criterion for definability in Presburger arithmetic and its applications , 2003, Theor. Comput. Sci..

[17]  Nils Klarlund,et al.  MONA Implementation Secrets , 2000, Int. J. Found. Comput. Sci..

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

[19]  Richard Gerber,et al.  Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results , 1999, TOPL.

[20]  Laurent Fribourg,et al.  Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic , 1997, CONCUR.

[21]  Leonard Berman,et al.  Precise bounds for presburger arithmetic and the reals with addition: Preliminary report , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).