Hybrid Acceleration using Real Vector Automata

Abstract : This paper addresses the problem of computing an exact and effective representation of the set of reachable configurations of a linear hybrid automaton. Our solution is based on accelerating the state-space exploration by computing symbolically the repeated effect of cycles in the automaton control graph. The computed sets of configurations are represented by Real Vector Automata (RVA), the expressive power of which is beyond that of the first-order additive theory of reals and integers. This approach makes it possible to compute in finite time sets of configurations that cannot be expressed as finite unions of convex sets. The main technical contributions of the paper consist in a powerful sufficient criterion for checking whether a hybrid transformation (i.e., with both discrete and continuous features) can be accelerated, as well as an algorithm for applying such an accelerated transformation on RVA. Our results have been implemented and successfully applied to several case studies, including the well-known leaking gas burner, and a simple communication protocol with timers.
Type de document :
Communication dans un congrès
Hunt, Warren A. Jr. and Somenzi, Fabio. Computer Aided Verification, 15th International Conference, Jul 2003, Boulder, CO, United States. Springer, 2725, pp.193-205, 2003, Lecture Notes in Computer Science
Liste complète des métadonnées


https://hal.inria.fr/inria-00335915
Contributeur : Frédéric Herbreteau <>
Soumis le : vendredi 31 octobre 2008 - 12:13:55
Dernière modification le : vendredi 31 octobre 2008 - 15:23:56
Document(s) archivé(s) le : lundi 7 juin 2010 - 19:56:00

Fichier

cav47.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00335915, version 1

Collections

Citation

Bernard Boigelot, Frédéric Herbreteau, Sébastien Jodogne. Hybrid Acceleration using Real Vector Automata. Hunt, Warren A. Jr. and Somenzi, Fabio. Computer Aided Verification, 15th International Conference, Jul 2003, Boulder, CO, United States. Springer, 2725, pp.193-205, 2003, Lecture Notes in Computer Science. <inria-00335915>

Partager

Métriques

Consultations de
la notice

156

Téléchargements du document

52