Reachability computation for polynomial dynamical systems
From MaRDI portal
Publication:526433
DOI10.1007/s10703-016-0266-3zbMath1360.93084OpenAlexW2569352989MaRDI QIDQ526433
Tommaso Dreossi, Carla Piazza, Thao Dang
Publication date: 12 May 2017
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11390/1108075
Nonlinear systems in control theory (93C10) Discrete-time control/observation systems (93C55) Attainable sets, reachability (93B03)
Related Items
Robustly complete synthesis of sampled-data control for continuous-time nonlinear systems with reach-and-stay objectives ⋮ Automatic dynamic parallelotope bundles for reachability analysis of nonlinear systems ⋮ Viability, viscosity, and storage functions in model-predictive control with terminal constraints ⋮ On polyhedral estimation of reachable sets in the ``extended space for discrete-time systems with uncertain matrices and integral constraints ⋮ Parameter synthesis of polynomial dynamical systems
Uses Software
Cites Work
- The Bernstein polynomial basis: a centennial retrospective
- A high-performance, portable implementation of the MPI message passing interface standard
- An equation for hyperchaos
- Nonstandard numerical methods for a mathematical model for influenza disease
- Reachability analysis of linear systems using support functions
- Subdivision methods for solving polynomial equations
- Differential dynamic logic for hybrid systems
- Discrete-time growth-dispersal models
- Discrete-time travelling waves: Ecological examples
- Verified integration of ODEs and flows using differential algebraic methods on high-order Taylor models
- Numerical integration on advanced computer systems
- Ellipsoidal techniques for reachability analysis: Internal approximation
- HyTech: A model checker for hybrid systems
- Investigation of a subdivision based algorithm for solving systems of polynomial equations.
- An equation for continuous chaos
- \(\epsilon\)-semantics computations on biological systems
- Control synthesis via parallelotopes: optimzation and parallel compuations
- Reachable set computation for uncertain time-varying linear systems
- A dynamic algorithm for approximate flow computations
- Parameter synthesis for polynomial biological models
- Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
- KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description)
- MARCO: A Reachability Algorithm for Multi-affine Systems with Applications to Biological Systems
- Reachability Analysis of Hybrid Systems Using Support Functions
- State estimation for dynamic systems via parallelotopes optimization and parallel computations
- Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations
- Parameter Synthesis Through Temporal Logic Specifications
- Sapo
- Hybrid Systems: Computation and Control
- Discrete Dynamical Systems
- Differential Dynamic Logic for Verifying Parametric Hybrid Systems
- Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
- Bernstein form of a polynomial
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Verification, Model Checking, and Abstract Interpretation
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Symbolic reachability computation for families of linear vector fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Reachability computation for polynomial dynamical systems
