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

This paper presents methods for using zonotopes and constrained zonotopes to improve the
practicality of a wide variety of set-based operations commonly used in control theory. The …

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 …

We introduce constrained polynomial zonotopes, a novel non-convex set representation that
is closed under linear map, Minkowski sum, Cartesian product, convex hull, intersection …

In this letter, we propose a novel approach for computing robust backward reachable sets
from noisy data for unknown constrained linear systems subject to bounded disturbances …

In this thesis, we present the three novel set representations sparse polynomial zonotopes,
constrained polynomial zonotopes, and the Z-representation of polytopes. One major …

Verification and synthesis of Cyber–Physical Systems (CPS) are challenging and still raise
numerous issues so far. In this paper, based on a new concept of mixed sets defined as …

This paper studies the controller synthesis problem for nonlinear control systems under
linear temporal logic (LTL) specifications using zonotope techniques. A local-to-global …

We introduce the M-representation of polytopes, which makes it possible to compute linear
transformations, convex hulls, and Minkowski sums with linear complexity in the dimension …

With low system inertia, cyber-physical networked microgrids are sensitive to operation
changes. A reachability analysis method is presented to efficiently quantify the impact of …