Acceleration of Affine Hybrid Transformations - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Acceleration of Affine Hybrid Transformations

Résumé

This work addresses the computation of the set of reachable configurations of linear hybrid automata. The approach relies on sym-bolic state-space exploration, using acceleration in order to speed up the computation and to make it terminate for a broad class of systems. Our contribution is an original method for accelerating the control cycles of linear hybrid automata, i.e., to compute their unbounded repeated effect. The idea consists in analyzing the data transformations that label these cycles, by reasoning about the geometrical features of the corresponding system of linear constraints. This approach is complete over Multiple Counters Systems (MCS), and is able to accelerate hybrid transforma-tions that are out of scope of existing techniques.
Fichier principal
Vignette du fichier
paper.pdf (326.34 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01076229 , version 1 (21-10-2014)

Identifiants

  • HAL Id : hal-01076229 , version 1

Citer

Bernard Boigelot, Frédéric Herbreteau, Isabelle Mainz. Acceleration of Affine Hybrid Transformations. Automated Technology for Verification and Analysis - 12th International Symposium, {ATVA}, Nov 2014, Sydney, Australia. ⟨hal-01076229⟩

Collections

CNRS
239 Consultations
99 Téléchargements

Partager

Gmail Facebook X LinkedIn More