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 symbolic 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… (More)
DOI: 10.1007/978-3-319-11936-6_4

2 Figures and Tables

Topics

  • Presentations referencing similar topics