Continuity and computability of reachable sets
From MaRDI portal
Publication:2566008
DOI10.1016/j.tcs.2005.05.001zbMath1154.93351OpenAlexW2113700085MaRDI QIDQ2566008
Publication date: 22 September 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/4004
Reachable setComputable analysisSemicontinuous functionApproximation representationComputable topological space
Related Items (20)
Computability and Dynamical Systems ⋮ Computation with perturbed dynamical systems ⋮ The ellipsoidal bound of reachable sets for linear neutral systems with disturbances ⋮ Contract-Based Design for Computation and Verification of a Closed-Loop Hybrid System ⋮ Computability and the morphological complexity of some dynamics on continuous domains ⋮ Assume–guarantee verification of nonlinear hybrid systems with <scp>Ariadne</scp> ⋮ COMPUTABLE SEMANTICS FOR CTL* ON DISCRETE-TIME AND CONTINUOUS-SPACE DYNAMIC SYSTEMS ⋮ Safety verification of non-linear hybrid systems is quasi-decidable ⋮ Effectivity and effective continuity of multifunctions ⋮ On the Continuity of Effective Multifunctions ⋮ Effectivity on Continuous Functions in Topological Spaces ⋮ On Computable Metrization ⋮ Computability in planar dynamical systems ⋮ Computability, noncomputability, and hyperbolic systems ⋮ On computably locally compact Hausdorff spaces ⋮ Computable analysis with applications to dynamic systems ⋮ The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems ⋮ Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems ⋮ Computability of Differential Equations ⋮ A Survey on Analog Models of Computation
Uses Software
Cites Work
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- Ellipsoidal calculus for estimation and control
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Computability on subsets of metric spaces.
- Set oriented methods for computing reachable sets and control sets
- Computable operators on regular sets
- On Ellipsoidal Techniques for Reachability Analysis. Part I: External Approximations
- On Ellipsoidal Techniques for Reachability Analysis. Part II: Internal Approximations Box-valued Constraints
- Set-valued analysis
- Viability theory
- 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: Continuity and computability of reachable sets