Skip to Main content Skip to Navigation
Conference papers

SpaceEx: Scalable Verification of Hybrid Systems

Abstract : We present a scalable reachability algorithm for hybrid systems with piecewise affine, non-deterministic dynamics. It combines polyhedra and support function representations of continuous sets to compute an over-approximation of the reachable states. The algorithm improves over previous work by using variable time steps to guarantee a given local error bound. In addition, we propose an improved approximation model, which drastically improves the accuracy of the algorithm. The algorithm is implemented as part of SpaceEx, a new verification platform for hybrid systems, available at Experimental results of full fixed-point computations with hybrid systems with more than 100 variables illustrate the scalability of the approach.
Document type :
Conference papers
Complete list of metadata
Contributor : Brigitte Bidégaray-Fesquet <>
Submitted on : Wednesday, January 2, 2013 - 3:00:46 PM
Last modification on : Tuesday, February 2, 2021 - 10:58:04 AM

Links full text




Goran Frehse, Colas Le Guernic, Alexandre Donzé, Scott Cotton, Rajarshi Ray, et al.. SpaceEx: Scalable Verification of Hybrid Systems. CAV 2011 - 23rd International Conference on Computer Aided Verification, Jul 2011, Snowbird, UT, United States. pp.379-395, ⟨10.1007/978-3-642-22110-1_30⟩. ⟨hal-00769608⟩