On the Construction of Automata from Linear Arithmetic Constraints
- 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
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.