From automata to formulas: convex integer polyhedra

Automata-based representations have recently been investigated as a tool for representing and manipulating sets of integer vectors. In this paper, we study some structural properties of automata accepting the encodings (most significant digit first) of the natural solutions of systems of linear Diophantine inequations, i.e., convex polyhedra in /spl Nopf//sup n/. Based on those structural properties, we develop an algorithm that takes as input an automaton and generates a quantifier-free formula that represents exactly the set of integer vectors accepted by the automaton. In addition, our algorithm generates the minimal Hilbert basis of the linear system. In experiments made with a prototype implementation, we have been able to synthesize in seconds formulas and Hilbert bases from automata with more than 10,000 states.

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

[2]  Bernard Boigelot.  Symbolic Methods for Exploring Infinite State Spaces , 1998 .

[3]  Alan Cobham,et al.  On the base-dependence of sets of numbers recognizable by finite automata , 1969, Mathematical systems theory.

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

[5]  Evelyne Contejean,et al.  Avoiding Slack Variables in the Solving of Linear Diophantine Equations and Inequations , 1997, Theor. Comput. Sci..

[6]  H. Smith.  I. On systems of linear indeterminate equations and congruences , 1862, Proceedings of the Royal Society of London.

[7]  Andrei Voronkov,et al.  Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking , 2002, CAV.

[8]  Bernard Boigelot,et al.  Counting the solutions of Presburger equations without enumerating them , 2001, Theor. Comput. Sci..

[9]  A. L. Semenov,et al.  Presburgerness of predicates regular in two number systems , 1977 .

[10]  D. Hilbert.  Ueber die Theorie der algebraischen Formen , 1890 .

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

[12]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

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

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

[15]  W. Pulleyblank,et al.  Total Dual Integrality and Integer Polyhedra , 1979 .

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

[17]  Thomas R. Shiple,et al.  A Comparison of Presburger Engines for EFSM Reachability , 1998, CAV.

[18]  Felix Klaedtke,et al.  On the automata size for Presburger arithmetic , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[19]  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 .