This paper deals with conservative reachability analysis of a class of hybrid systems with continuous dynamics described by linear differential inclusions, convex invariants and guards, and linear reset maps. We present an approach for computing over-approximations of the set of reachable states. It is based on the notion of support function and thus it allows us to consider invariants, guards and constraints on continuous inputs and initial states defined by arbitrary compact convex sets. We show how the properties of support functions make it possible to derive an effective algorithm for approximate reachability analysis of hybrid systems. We use our approach on some examples including the navigation benchmark for hybrid systems verification. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Le Guernic, C., & Girard, A. (2009). Reachability analysis of hybrid systems using support functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5643 LNCS, pp. 540–554). https://doi.org/10.1007/978-3-642-02658-4_40
Mendeley helps you to discover research relevant for your work.