S. Bardin, A. Finkel, J. Leroux, and L. Petrucci, FAST: Fast Acceleration of Symbolic Transition Systems, Proc. 15th Int. Conf. Computer Aided Veriication (CAV'2003), p.1188121, 2003.
DOI : 10.1007/978-3-540-45069-6_12
URL : https://hal.archives-ouvertes.fr/hal-00084185

C. Bartzis and T. Bultan, EEcient symbolic representations for arithmetic constraints in veriication, International Journal of Foundations of Computer Science (IJFCS), vol.14, issue.4, p.6055624, 2003.

C. Bartzis and T. Bultan, Widening Arithmetic Automata, Proc. 16th Int. Conf. Computer Aided Veriication Omni Parker House Hotel, p.3211333, 2004.
DOI : 10.1007/978-3-540-27813-9_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.614

L. Berman, Precise bounds for presburger arithmetic and the reals with addition: Preliminary report, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.95599-95630, 1977.
DOI : 10.1109/SFCS.1977.23

A. Blumensath and E. Grrdel, Finite presentations of innnite structures, Proc. 2nd Int. Workshop on Complexity in Automated Deduction, 2002.

B. Boigelot, Symbolic Methods for Exploring Innnite State Spaces, 1998.

A. Boudet and H. Comon, Diophantine equations, Presburger arithmetic and nite automata, Proc. 21st Int Linkk ping, Sweden, p.30043, 1996.

V. Bruyyre, G. Hansel, C. Michaux, and R. Villemaire, Logic and precognizable sets of integers, Bull. Belg. Math. Soc, vol.1, issue.2, p.1911238, 1994.

R. E. Bryant, Symbolic Boolean manipulation with ordered binary-decision diagrams, ACM Computing Surveys, vol.24, issue.3, p.2933318, 1992.
DOI : 10.1145/136035.136043
URL : http://akebono.stanford.edu/users/nanni/courses/EE318/bryant92.pdf

P. Cousot and N. Halbwachs, Automatic discovery of linear restraints among variables of a program, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '78, p.84496, 1978.
DOI : 10.1145/512760.512770

V. Ganesh, S. Berezin, and D. L. Dill, Deciding Presburger Arithmetic by Model Checking and Comparisons with Other Methods, Proc. 4th Int. Conf. Formal Methods in Computer Aided Design (FMCAD'02), p.1711186, 2002.
DOI : 10.1007/3-540-36126-X_11

S. Ginsburg and E. H. Spanier, Semigroups, Presburger formulas, and languages, Pacific Journal of Mathematics, vol.16, issue.2, p.2855296, 1966.
DOI : 10.2140/pjm.1966.16.285

F. Klaedtke, On the automata size for Presburger arithmetic, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., p.1100119, 2004.
DOI : 10.1109/LICS.2004.1319605

N. Klarlund, A. Mm, and M. I. Schwartzbach, MONA implementation secrets, Int. J. of Foundations Computer Science, vol.13, issue.4, p.5711586, 2002.

J. Leroux, The aane hull of a binary automaton is computable in polynomial time, Proc. 5th Int. Workshop on Veriication of Innnite State Systems (INFINITY 2003), p.899104, 2003.

J. Leroux, A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), 2005.
DOI : 10.1109/LICS.2005.2
URL : https://hal.archives-ouvertes.fr/hal-00346307

A. Muchnik, Deenable criterion for deenability in presburger arithmetic and its applications. (in russian), preprint, Institute of new technologies, 1991.

A. Muchnik, The deenable criterion for deenability in presburger arithmetic and its applications, Theoretical Computer Science, vol.290, p.143331444, 2003.

M. Presburger, Uber die volstandigkeit eines gewissen systems der arithmetik ganzer zahlen, in welchem die addition als einzige operation hervortritt, C. R. 1er congres des Mathematiciens des pays slaves, p.922101, 1929.

T. Rybina and A. Voronkov, BRAIN: Backward Reachability Analysis with Integers, Proc. 9th Int. Conf. Algebraic Methodology and Software Technology (AMAST'2002), p.4899494, 2002.
DOI : 10.1007/3-540-45719-4_33

P. Wolper and B. Boigelot, An automata-theoretic approach to Presburger arithmetic constraints, Proc. 2nd Int. Symp. Static Analysis (SAS'95), p.21132, 1995.
DOI : 10.1007/3-540-60360-3_30

P. Wolper and B. Boigelot, On the Construction of Automata from Linear Arithmetic Constraints, Proc. 6th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'2000), p.1119, 2000.
DOI : 10.1007/3-540-46419-0_1