An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract)

This paper introduces a finite-automata based representation of Presburger arithmetic definable sets of integer vectors. The representation consists of concurrent automata operating on the binary encodings of the elements of the represented sets. This representation has several advantages. First, being automata-based it is operational in nature and hence leads directly to algorithms, for instance all usual operations on sets of integer vectors translate naturally to operations on automata. Second, the use of concurrent automata makes it compact. Third, it is insensitive to the representation size of integers. Our representation can be used whenever arithmetic constraints are needed. To illustrate its possibilities we show that it can handle integer programming optimally, and that it leads to a new original algorithm for the satisfiability of arithmetic inequalities.

[1]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[2]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[3]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[4]  Pierre Wolper,et al.  Symbolic Verification with Periodic Sets , 1994, CAV.

[5]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[6]  Pierre Wolper,et al.  Using partial orders for the efficient verification of deadlock freedom and safety properties , 1991, Formal Methods Syst. Des..

[7]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

[8]  S. Sieber.  On a decision method in restricted second-order arithmetic , 1960 .

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

[10]  Christos H. Papadimitriou,et al.  On the complexity of integer programming , 1981, JACM.

[11]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[12]  Wolfgang Thomas,et al.  Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics , 1990 .

[13]  Gabriel M. Kuper,et al.  Constraint query languages (preliminary report) , 1990, PODS '90.

[14]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[15]  Thomas A. Henzinger,et al.  Real-Time Logics: Complexity and Expressiveness , 1993, Inf. Comput..

[16]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[17]  Anthony C. Klug.  On conjunctive queries containing inequalities , 1988, JACM.

[18]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[19]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[20]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

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

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

[23]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[24]  Alexander Moshe Rabinovich,et al.  Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract) , 1992, ICALP.

[25]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[26]  Pierre Wolper,et al.  Handling infinite temporal data , 1990, PODS.

[27]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[28]  Thomas A. Henzinger,et al.  Real-time logics: complexity and expressiveness , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[29]  Bernard Boigelot,et al.  Symbolic Veri cation with Periodic Sets ? , 1994 .

[30]  Wei Sun,et al.  An Improved Algorithm for Implication Testing Involving Arithmetic Inequalities , 1994, IEEE Trans. Knowl. Data Eng..