Sapo: Reachability Computation and Parameter Synthesis of Polynomial Dynamical Systems. Sapo is a tool for the formal analysis of polynomial dynamical systems. Its main features are 1) Reachability computation, i.e., the calculation of the set of states reachable from a set of initial conditions, and 2) Parameter synthesis, i.e., the refinement of a set of parameters so that the system satisfies a given specification. Sapo can represent reachable sets as unions of boxes, parallelotopes, or parallelotope bundles (symbolic representation of polytopes). Sets of parameters are represented with polytopes while specifications are formalized as Signal Temporal Logic (STL) formulas.
Keywords for this software
References in zbMATH (referenced in 3 articles , 1 standard article )
Showing results 1 to 3 of 3.
- Magron, Victor; Garoche, Pierre-Loic; Henrion, Didier; Thirioux, Xavier: Semidefinite approximations of reachable sets for discrete-time polynomial systems (2019)
- Dreossi, Tommaso: Sapo: reachability computation and parameter synthesis of polynomial dynamical systems (2017)
- Dreossi, Tommaso; Dang, Thao; Piazza, Carla: Reachability computation for polynomial dynamical systems (2017)