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 …

We introduce sparse polynomial zonotopes, a new set representation for formal verification
of hybrid systems. Sparse polynomial zonotopes can represent nonconvex sets and are …

While a number of Lagrangian algorithms to approximate reachability in dozens or even
hundreds of dimensions for systems with linear dynamics have recently appeared in the …

Hamilton-Jacobi-Isaacs (HJI) reachability analysis is a powerful tool for analyzing the safety
of autonomous systems. This analysis is computationally intensive and typically performed …

Reachability analysis is a formal method to guarantee safety of dynamical systems under the
influence of uncertainties. A substantial bottleneck of all reachability algorithms is the …

Hamilton-Jacobi (HJ) reachability analysis has been developed over the past decades into a
widely-applicable tool for determining goal satisfaction and safety verification in nonlinear …

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

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

We propose a scalable method for forward stochastic reachability analysis for uncontrolled
linear systems with affine disturbance. Our method uses Fourier transforms to efficiently …

A nonlinear aircraft dynamics modeling and system identification approach is formulated
and used to derive a rapid, convex optimization-based algorithm for the estimation of …