An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract)
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Diophantine Equations, Presburger Arithmetic and Finite Automata
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Presburger arithmetic with bounded quantifier alternation
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Learning regular languages using RFSAs
Theoretical Computer Science - Special issue: Algorithmic learning theory
Identification of biRFSA languages
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Residual Finite State Automata
Fundamenta Informaticae
Learning to verify branching time properties
Formal Methods in System Design
Bounds on the automata size for Presburger arithmetic
ACM Transactions on Computational Logic (TOCL)
Structural Presburger digit vector automata
Theoretical Computer Science
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
| Hi-index | 0.00 |
A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithmetic based on quantifier elimination is known (roughly, there is a double-exponential non-deterministic time lower bound and a triple exponential deterministic time upper bound), the exact complexity of the automata-based procedure was unknown. We show in this paper that it is triple-exponential as well by analysing the structure of the non-deterministic automata obtained during the construction. Furthermore, we analyse the sizes of deterministic and nondeterministic automata built for several subclasses of Presburger arithmetic such as disjunctions and conjunctions of atomic formulas. To retain a canonical representation which is one of the strengths of the use of automata we use residual finite-state automata, a subclass of non-deterministic automata.