International audienceThis 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 hy...
International audienceReachability analysis consists in computing the set of states that are reachab...
The method for verification of hybrid systems by constraint propagation based abstraction refinement...
Hybrid systems in computer science are systems with combined discrete-continuous behavior. This work...
This thesis addresses the problem of reachability analysis with the focus on linear hybrid systems. ...
Although a growing number of dynamical systems studied in various fields are hybrid in nature, the v...
Special Issue: IFAC World Congress 2008International audienceThis work is concerned with the algorit...
Reachability analysis aims at identifying states reachable by a system within a given time horizon. ...
We present the framework of δ-complete analysis for bounded reachability problems of general hybrid ...
We present the framework of δ-complete analysis for bounded reachability problems of general hybrid ...
This thesis is devoted to the problem of computing reachable sets of linear and hybrid systems. In t...
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper we desc...
Abstract. In this paper we describe an experimental system called d=dt for approximating reachable s...
This paper addresses the exact computation of the set of reachable states of a strongly linear hybri...
Abstract. This paper addresses the exact computation of the set of reachable states of a strongly li...
International audienceSet-based reachability analysis computes all possible states a system may atta...
International audienceReachability analysis consists in computing the set of states that are reachab...
The method for verification of hybrid systems by constraint propagation based abstraction refinement...
Hybrid systems in computer science are systems with combined discrete-continuous behavior. This work...
This thesis addresses the problem of reachability analysis with the focus on linear hybrid systems. ...
Although a growing number of dynamical systems studied in various fields are hybrid in nature, the v...
Special Issue: IFAC World Congress 2008International audienceThis work is concerned with the algorit...
Reachability analysis aims at identifying states reachable by a system within a given time horizon. ...
We present the framework of δ-complete analysis for bounded reachability problems of general hybrid ...
We present the framework of δ-complete analysis for bounded reachability problems of general hybrid ...
This thesis is devoted to the problem of computing reachable sets of linear and hybrid systems. In t...
Colloque avec actes et comité de lecture. internationale.International audienceIn this paper we desc...
Abstract. In this paper we describe an experimental system called d=dt for approximating reachable s...
This paper addresses the exact computation of the set of reachable states of a strongly linear hybri...
Abstract. This paper addresses the exact computation of the set of reachable states of a strongly li...
International audienceSet-based reachability analysis computes all possible states a system may atta...
International audienceReachability analysis consists in computing the set of states that are reachab...
The method for verification of hybrid systems by constraint propagation based abstraction refinement...
Hybrid systems in computer science are systems with combined discrete-continuous behavior. This work...