Convex Hull of Arithmetic Automata - Archive ouverte HAL
Communication Dans Un Congrès Année : 2008

Convex Hull of Arithmetic Automata

Résumé

Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints combining both integral and real variables. In this paper, the closed convex hull of arithmetic automata is proved rational polyhedral. Moreover an algorithm computing the linear constraints defining these convex set is provided. Such an algorithm is useful for effectively extracting geometrical properties of the whole set of solutions of complex constraints symbolically represented by arithmetic automata.
Fichier principal
Vignette du fichier
main.pdf (280.22 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00346001 , version 1 (10-12-2008)

Identifiants

Citer

Jérôme Leroux. Convex Hull of Arithmetic Automata. Static Analysis, 2008, Valencia, Spain. pp.47-61, ⟨10.1007/978-3-540-69166-2_4⟩. ⟨hal-00346001⟩

Collections

CNRS ANR
118 Consultations
170 Téléchargements

Altmetric

Partager

More