Abstract
The Number Decision Diagram (NDD) has recently been proposed as a powerful representation system for sets of integer vectors. In particular, NDDs can be used for representing the sets of solutions of arbitrary Presburger formulas, or the set of reachable states of some systems using unbounded integer variables. In this paper, we address the problem of counting the number of distinct elements in a set of vectors represented as an NDD. We give an algorithm that is able to perform an exact count without enumerating explicitly the vectors, which makes it capable of handling very large sets. As an auxiliary result, we also develop an efficient projection method that allows to construct efficiently NDDs from quantified formulas, and thus makes it possible to apply our counting technique to sets specified by formulas. Our algorithms have been implemented in the verification tool LASH, and applied successfully to various counting problems.
This work was partially funded by a grant of the “Communauté française de Belgique — Direction de la recherche scientifique — Actions de recherche concertées”, and by the European Commission (FET project ADVANCE, contract No IST-1999-29082).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
V. Bruyére, G. Hansel, C. Michaux, and R. Villemaire. Logic and p- recognizable sets of integers. Bulletin of the Belgian Mathematical Society, 1(2):191–238, March 1994.
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.
A. Cobham. On the base-dependence of sets of numbers recognizable by finite automata. Mathematical Systems Theory, 3:186–192, 1969.
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.
F. Kabanza, J.-M. Stevenne, and P. Wolper. Handling infinite temporal data. Journal of computer and System Sciences, 51(1):3–17, 1995.
The Liége Automata-based Symbolic Handler (LASH). Available at http://www.montefiore.ulg.ac.be/~boigelot/research/lash/.
M. Padberg and M. Rijal. Location, Scheduling, Design and Integer Programming. Kluwer Academic Publishers, Massachusetts, 1996.
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.
W. Pugh. The Omega Test: A fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, pages 102–114, August 1992.
W. Pugh. Counting solutions to Presburger formulas: How and why. SIG-PLAN, 94-6/94:121–134, 1994.
A. Schrijver. Theory of Linear and Integer Programming. John Wiley & sons, Chichester, 1986.
A. L. Semenov. Presburgerness of predicates regular in two number systems. Siberian Mathematical Journal, 18:289–299, 1977.
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.
A. Valmari. State space generation with induction. In Proceedings of the SCAI’89, pages 99–115, Tampere, Finland, June 1989.
P. Wolper and B. Boigelot. An automata-theoretic approach to Presburger arithmetic constraints. In Proceedings of Static Analysis Symposium, volume 983 of Lecture Notes in Computer Science, pages 21–32, Glasgow, September 1995. Springer-Verlag.
P. Wolper and B. Boigelot. On the construction of automata from linear arithmetic constraints. 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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boigelot, B., Latour, L. (2002). Counting the Solutions of Presburger Equations without Enumerating Them. In: Watson, B.W., Wood, D. (eds) Implementation and Application of Automata. CIAA 2001. Lecture Notes in Computer Science, vol 2494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36390-4_4
Download citation
DOI: https://doi.org/10.1007/3-540-36390-4_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00400-4
Online ISBN: 978-3-540-36390-3
eBook Packages: Springer Book Archive