BRAIN: Backward Reachability Analysis with Integers
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Deciding Presburger Arithmetic by Model Checking and Comparisons with Other Methods
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
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
The definable criterion for definability in Presburger arithmetic and its applications
Theoretical Computer Science
On the Automata Size for Presburger Arithmetic
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
How to Tackle Integer Weighted Automata Positivity
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
On the use of non-deterministic automata for presburger arithmetic
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
A completion algorithm for lattice tree automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 5.25 |
The least significant digit first decomposition of integer vectors into words of digit vectors provides a natural way for representing sets of integer vectors by automata. In this paper, the minimal automata representing Presburger sets are proved structurally Presburger: automata obtained by moving the initial state and replacing the accepting condition represent Presburger sets.