Acceleration of Affine Hybrid Transformations

Abstract : 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.
Type de document :
Communication dans un congrès
Franck Cassez and Jean-François Raskin. Automated Technology for Verification and Analysis - 12th International Symposium, , Nov 2014, Sydney, Australia. Springer, 8837, 2014, Lecture Notes in Computer Science
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01076229
Contributeur : Frédéric Herbreteau <>
Soumis le : mardi 21 octobre 2014 - 15:14:47
Dernière modification le : mardi 28 octobre 2014 - 18:57:37
Document(s) archivé(s) le : jeudi 22 janvier 2015 - 10:36:26

Fichier

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

Identifiants

  • HAL Id : hal-01076229, version 1

Collections

Citation

Bernard Boigelot, Frédéric Herbreteau, Isabelle Mainz. Acceleration of Affine Hybrid Transformations. Franck Cassez and Jean-François Raskin. Automated Technology for Verification and Analysis - 12th International Symposium, , Nov 2014, Sydney, Australia. Springer, 8837, 2014, Lecture Notes in Computer Science. 〈hal-01076229〉

Partager

Métriques

Consultations de la notice

130

Téléchargements de fichiers

43