Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Frédéric Herbreteau <>
Submitted on : Tuesday, October 21, 2014 - 3:14:47 PM
Last modification on : Thursday, January 11, 2018 - 6:20:17 AM
Long-term archiving on: : Thursday, January 22, 2015 - 10:36:26 AM


Files produced by the author(s)


  • HAL Id : hal-01076229, version 1



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



Record views


Files downloads