In this work we present parallelotope bundles, ie, sets of parallelotopes for a symbolic
representation of polytopes. We define a compact representation of these objects and show …

Sapo is a tool for the formal analysis of polynomial dynamical systems. Its main features are
1) Reachability computation, ie, the calculation of the set of states reachable from a set of …

The increasing size of recently proposed Neural Networks makes it hard to implement them
on embedded devices, where memory, battery and computational power are a non-trivial …

This paper is concerned with the problem of computing the bounded time reachable set of a
polynomial discrete-time dynamical system. The problem is well-known for being difficult …

Parametric dynamical systems emerge as a formalism for modeling natural and engineered
systems ranging from biology, epidemiology, and medicine to cyber-physics. Parameter …

Reachable set computation is one of the many widely-used techniques for the verification of
safety properties of dynamical systems. One of the simplest algorithms for computing …

In set-based reachability, a cover of the reachable states of a hybrid system is obtained by
repeatedly computing one-step successor states. It can be used to show safety or to obtain …

Reachable set computation is an important technique for the verification of safety properties
of dynamical systems. In this paper, we investigate reachable set computation for discrete …

The understanding of biological systems and processes requires the development of
dynamical models characterized by nonlinear laws and often intricate regulation …

Dynamical systems are systems in which states evolve according to some laws. Their simple
definition hides a powerful tool successfully adopted in many domains from physics to …