Counting the solutions of Presburger equations without enumerating them

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2494, Issue , 2002, Pages 40-51

  Boigelot, Bernard ^a   Latour, Louis ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ROBOTS;

COUNTING PROBLEMS; COUNTING TECHNIQUES; DISTINCT ELEMENTS; INTEGER VARIABLES; INTEGER VECTORS; NUMBER DECISION DIAGRAMS; PROJECTION METHOD; VERIFICATION TOOLS;

AUTOMATA THEORY;

EID: 84945307580     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36390-4_4     Document Type: Conference Paper

References (17)

1. A. Boudet and H. Comon. Diophantine equations, Presburger arithmetic and finite automata. In Proceedings of CAAP'96, number 1059 in Lecture Notes in Computer Science, pages 30-43. Springer-Verlag, 1996.
2. V. Bruyère, G. Hansel, C. Michaux, and R. Villemaire. Logic and precognizable sets of integers. Bulletin of the Belgian Mathematical Society, 1(2): 191-238, March 1994.
3. B. Boigelot. Symbolic Methods for Exploring Infinite State Spaces. Collection des publications de la Faculté des Sciences Appliquées de l'Université de Liège, Liège, Belgium, 1999.
4. A. Cobham. On the base-dependence of sets of numbers recognizable by finite automata. Mathematical Systems Theory, 3: 186-192, 1969.
5. L. Fribourg and H. Olsén. Proving safety properties of infinite state systems by compilation into Presburger arithmetic. In Proceedings of CONCUR'97, volume 1243, pages 213-227, Warsaw, Poland, July 1997. Springer-Verlag.
6. F. Kabanza, J.-M. Stevenne, and P. Wolper. Handling infinite temporal data. Journal of computer and System Sciences, 51(1): 3-17, 1995.
7. The Liège Automata-based SymbolicHa ndler (LASH). Available at http://www.montefiore.ulg.ac.be/~boigelot/research/lash/.
8. M. Padberg and M. Rijal. Location, Scheduling, Design and Integer Programming. Kluwer Academic Publishers, Massachusetts, 1996.
9. M. Presburger. Über die Volständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In Comptes Rendus du Premier Congrès des Mathématiciens des Pays Slaves, pages 92-101, Warsaw, Poland, 1929.
10. W. Pugh. The Omega Test: A fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, pages 102-114, August 1992.
11. W. Pugh. Counting solutions to Presburger formulas: How and why. SIGPLAN, 94-6/94: 121-134, 1994.
12. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & sons, Chichester, 1986.
13. A. L. Semenov. Presburgerness of predicates regular in two number systems. Siberian Mathematical Journal, 18: 289-299, 1977.
14. T. R. Shiple, J. H. Kukula, and R. K. Ranjan. A comparison of Presburger engines for EFSM reachability. In Proceedings of the 10th Intl. Conf. on Computer-Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 280-292, Vancouver, June/July 1998. Springer-Verlag.
15. A. Valmari. State space generation with induction. In Proceedings of the SCAI'89, pages 99-115, Tampere, Finland, June 1989.
16. P.Wolper and B. Boigelot. An automata-theoreticap proach to Presburger arithmeticc onstraints. In Proceedings of Static Analysis Symposium, volume 983 of Lecture Notes in Computer Science, pages 21-32, Glasgow, September 1995. Springer-Verlag.
17. P. Wolper and B. Boigelot. On the construction of automata from linear arithmeticc onstraints. In Proc. 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 1785 of Lecture Notes in Computer Science, pages 1-19, Berlin, March 2000. Springer-Verlag.