Abstract
Automata-based decision procedures have proved to be a particularly useful tool for infinite-state model checking, where automata are used to represent sets of real and integer values. However, not all theoretical aspects of these decision procedures are completely understood. We establish triple exponential upper bounds on the automata size for FO\(({\mathbb Z} ,+,<)\) and FO\(({\mathbb R},Z,+,<)\). While a similar bound for Presburger Arithmetic, i.e., FO\(({\mathbb Z},+,<)\) was obtained earlier using a quantifier elimination based approach, the bound for FO\(({\mathbb R},Z,+,<)\) is novel. We define two graded back-and-forth systems, and use them to derive bounds on the automata size by establishing a connection between those systems and languages that can be described by formulas in the respective logics. With these upper bounds that match the known lower bounds, the theoretical background for automata-based decision procedures for linear arithmetics becomes more complete.
This work was supported by the Deutsche Forschungsgemeinschaft (German Research Foundation).
Due to space limitations, proofs are omitted. Details are in the technical report [10].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: Fast acceleration of symbolic transition systems. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 118–121. Springer, Heidelberg (2003)
Becker, B., Dax, C., Eisinger, J., Klaedtke, F.: LIRA: Handling constraints of linear arithmetics over the integers and the reals. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 307–310. Springer, Heidelberg (2007)
Boigelot, B., Jodogne, S., Wolper, P.: An effective decision procedure for linear arithmetic over the integers and reals. ACM Trans.Comput. Log. 6, 614–633 (2005)
Boigelot, B., Wolper, P.: Representing arithmetic constraints with finite automata: An overview. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 1–19. Springer, Heidelberg (2002)
Büchi, J.: Weak second-order arithmetic and finite automata. Zeitschrift der mathematischen Logik und Grundlagen der Mathematik 6, 66–92 (1960)
Büchi, J.: On a decision method in restricted second order arithmetic. In: Logic, Methodology and Philosophy of Science (Proc. 1960 Internat. Congr.), pp. 1–11. Stanford University Press (1962)
Cooper, D.C.: Theorem proving in arithmetic without multiplication. In: Meltzer, B., Michie, D. (eds.) Proceedings of the 7th Annual Machine Intelligence Workshop, pp. 91–100. Edinburgh University Press (1972)
Couvreur, J.-M.: A BDD-like implementation of an automata package. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 310–311. Springer, Heidelberg (2005)
Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical Logic, 2nd edn. Springer, Heidelberg (1994)
Eisinger, J.: Upper bounds on the automata size for integer and mixed real and integer linear arithmetic, Tech. Report 239, Institut für Informatik, Universität Freiburg (2008)
Eisinger, J., Klaedtke, F.: Don’t care words with an application to the automata-based approach for real addition. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 67–80. Springer, Heidelberg (2006)
Ferrante, J., Rackoff, C.: The Computational Complexity of Logical Theories. LNM, vol. 718. Springer, Heidelberg (1979)
Fischer, M.J., Rabin, M.O.: Super-exponential complexity of presburger arithmetic, tech. report, Massachusetts Institute of Technology, Cambridge, MA, USA (1974)
Hodges, W.: A shorter model theory. Cambridge University Press, New York (1997)
Klaedtke, F.: On the automata size for Presburger arithmetic. In: LICS 2004, pp. 110–119. IEEE Computer Society Press, Los Alamitos (2004)
Klaedtke, F.: Ehrenfeucht-Fraïssé goes automatic for real addition. In: STACS 2008. IBFI Schloss Dagstuhl, pp. 445–456 (2008)
Kozen, D.: Theory of Computation. Springer, New York (2006)
LASH, The Liège Automata-based Symbolic Handler, http://www.montefiore.ulg.ac.be/~boigelot/research/lash/
Löding, C.: Efficient minimization of deterministic weak ω-automata. Information Processing Letters 79, 105–109 (2001)
Maler, O., Staiger, L.: On syntactic congruences for omega-languages. Theoretical Comput. Sci. 181, 93–112 (1997)
Weispfenning, V.: Mixed real-integer linear quantifier elimination. In: ISSAC 1999, pp. 129–136. ACM, New York (1999)
Weispfenning, V., Loos, R.: Applying linear quantifier elimination. The Computer Journal 36, 450–462 (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eisinger, J. (2008). Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract). In: Kaminski, M., Martini, S. (eds) Computer Science Logic. CSL 2008. Lecture Notes in Computer Science, vol 5213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87531-4_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-87531-4_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87530-7
Online ISBN: 978-3-540-87531-4
eBook Packages: Computer ScienceComputer Science (R0)