Reachability analysis consists in computing the set of states that are reachable by a
dynamical system from all initial states and for all admissible inputs and parameters. It is a …

Ensuring safety is crucial for the successful deployment of autonomous systems, such as self-
driving vehicles, unmanned aerial vehicles, and robots acting close to humans. While there …

In this paper, we propose a convex programming based method to address a long-standing
problem of inner-approximating backward reachable sets of state-constrained polynomial …

With the ubiquitous use of computers in controlling physical systems, it requires to have a
new formalism that could model both continuous flows and discrete jumps. Hybrid systems …

We investigate the information and guarantees provided by different inner and outer
approximated reachability analyses, for proving properties of dynamical systems. We …

Backward reachability analysis is essential to synthesizing controllers that ensure the
correctness of closed-loop systems. This article is concerned with developing scalable …

We describe a set-based approach, relying on mean-value extensions, for computing
guaranteed under-approximations of ranges (or images) of continuously differentiable …

We propose an approach for computing inner-approximations (also called under-
approximations) of reachable sets of dynamical systems defined by non-linear, uncertain …

We present a novel approach to compute non-convex inner-approximations of reachable
sets for nonlinear continuous systems. The concept of our approach is to extract inner …

In many reachability algorithms for nonlinear ordinary differential equations (ODEs), the
tightness of the computed reachable sets mainly depends on abstraction errors and the …