Reachability computation for polynomial dynamical systems
type: Item
instance of: scholarly article
title: Reachability computation for polynomial dynamical systems
zbMATH Open document ID: 1360.93084
author: Tommaso Dreossi
author: Thao Dang
author: Carla Piazza
published in: Formal Methods in System Design
publication date: 2017-05-12T00:00:00Z
full work available at URL: http://hdl.handle.net/11390/1108075
Mathematics Subject Classification ID: 93B03
Mathematics Subject Classification ID: 93C55
Mathematics Subject Classification ID: 93C10
zbMATH DE Number: 6715261
zbMATH Keywords: reachability
zbMATH Keywords: polynomial dynamical systems
zbMATH Keywords: Bernstein coefficients
describes a project that uses: KeYmaera
describes a project that uses: PHAVer
describes a project that uses: HyTech
describes a project that uses: Ariadne
describes a project that uses: pyHybrid Analysis
describes a project that uses: MARCO
describes a project that uses: dReach
describes a project that uses: Flow*
describes a project that uses: Sapo
describes a project that uses: MPI/MPICH
describes a project that uses: CUDA
describes a project that uses: MPT
describes a project that uses: Ellipsoidal Toolbox
describes a project that uses: SpaceEx
MaRDI profile type: Publication
OpenAlex ID: W2569352989
cites work: Reachable set computation for uncertain time-varying linear systems
cites work: Q4552457
cites work: Q4953376
cites work: Differential dynamic logic for hybrid systems
cites work: MARCO: A Reachability Algorithm for Multi-affine Systems with Applications to Biological Systems
cites work: Verified integration of ODEs and flows using differential algebraic methods on high-order Taylor models
cites work: Q4953384
cites work: Q4249563
cites work: Discrete-time growth-dispersal models
cites work: \(\epsilon\)-semantics computations on biological systems
cites work: Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
cites work: Nonstandard numerical methods for a mathematical model for influenza disease
cites work: Q4246810
cites work: Q4249565
cites work: Q5787302
cites work: Hybrid Systems: Computation and Control
cites work: Parameter Synthesis Through Temporal Logic Specifications
cites work: Q3510853
cites work: Sapo
cites work: Parameter synthesis for polynomial biological models
cites work: Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods
cites work: The Bernstein polynomial basis: a centennial retrospective
cites work: Discrete Dynamical Systems
cites work: Investigation of a subdivision based algorithm for solving systems of polynomial equations.
cites work: A high-performance, portable implementation of the MPI message passing interface standard
cites work: HyTech: A model checker for hybrid systems
cites work: Q3782632
cites work: Q4142699
cites work: State estimation for dynamic systems via parallelotopes optimization and parallel computations
cites work: Control synthesis via parallelotopes: optimzation and parallel compuations
cites work: Discrete-time travelling waves: Ecological examples
cites work: Numerical integration on advanced computer systems
cites work: Ellipsoidal techniques for reachability analysis: Internal approximation
cites work: Symbolic reachability computation for families of linear vector fields
cites work: Reachability Analysis of Hybrid Systems Using Support Functions
cites work: Reachability analysis of linear systems using support functions
cites work: Subdivision methods for solving polynomial equations
cites work: Differential Dynamic Logic for Verifying Parametric Hybrid Systems
cites work: KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description)
cites work: A dynamic algorithm for approximate flow computations
cites work: An equation for continuous chaos
cites work: An equation for hyperchaos
cites work: Symbolic Model Checking of Hybrid Systems Using Template Polyhedra

Reachability computation for polynomial dynamical systems (cites work)
cites work: Verification, Model Checking, and Abstract Interpretation

Reachability computation for polynomial dynamical systems (cites work)
cites work: Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations

Reachability computation for polynomial dynamical systems (cites work)
cites work: Bernstein form of a polynomial

Reachability computation for polynomial dynamical systems (cites work)
cites work: Q4418863

Reachability computation for polynomial dynamical systems (cites work)
cites work: Q4503932

Reachability computation for polynomial dynamical systems (DOI)
DOI: 10.1007/S10703-016-0266-3