On the Construction of Automata from Linear Arithmetic Constraints

  • Pierre Wolper
  • Bernard Boigelot
Conference paper

DOI: 10.1007/3-540-46419-0_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1785)
Cite this paper as:
Wolper P., Boigelot B. (2000) On the Construction of Automata from Linear Arithmetic Constraints. In: Graf S., Schwartzbach M. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2000. Lecture Notes in Computer Science, vol 1785. Springer, Berlin, Heidelberg

Abstract

This paper presents an overview of algorithms for constructing automata from linear arithmetic constraints. It identifies one case in which the special structure of the automata that are constructed allows a linear-time determinization procedure to be used. Furthermore, it shows through theoretical analysis and experiments that the special structure of the constructed automata does, in quite a general way, render the usual upper bounds on automata operations vastly overpessimistic.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Pierre Wolper
    • 1
  • Bernard Boigelot
    • 1
  1. 1.Institut Montefiore, B28Université de LiègeLiège Sart-TilmanBelgium

Personalised recommendations