Spaceex: Scalable verification of hybrid systems (2011)
| Venue: | In Proceedings of the International Conference on Computer Aided Verification |
| Citations: | 6 - 0 self |
BibTeX
@INPROCEEDINGS{Frehse11spaceex:scalable,
author = {Goran Frehse and Colas Le Guernic and Re Donzé and Scott Cotton and Rajarshi Ray and Olivier Lebeltel and Rodolfo Ripado and Antoine Girard and Thao Dang},
title = {Spaceex: Scalable verification of hybrid systems},
booktitle = {In Proceedings of the International Conference on Computer Aided Verification},
year = {2011}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 spaceex.imag.fr. Experimental results of full fixed-point computations with hybrid systems with more than 100 variables illustrate the scalability of the approach. 1
