Optimal semicomputable approximations to reachable and invariant sets

DOI10.1007/S00224-006-1338-3zbMATH Open1118.93320OpenAlexW2023384404MaRDI QIDQ2642902FDOQ2642902

Authors: Pieter Collins 

Publication date: 6 September 2007

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-006-1338-3

Recommendations

• Continuity and computability of reachable sets
• scientific article; zbMATH DE number 1507212
• Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
• Approximation of reachable sets using optimal control algorithms
• Computing the viability kernel using maximal reachable sets

zbMATH Keywords

computable analysisdiscrete-time systemsTuring machines

Mathematics Subject Classification ID

Attainable sets, reachability (93B03) Nonlinear systems in control theory (93C10) Discrete-time control/observation systems (93C55)

Cited In (7)

• Semantics and computability of the evolution of hybrid systems
• Continuity and computability of reachable sets
• Computable semantics for \(\text{CTL}^*\) on discrete-time and continuous-space dynamic systems
• Verification of Hybrid Systems
• The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
• Computable analysis with applications to dynamic systems
• Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems

Uses Software

• PHAVer
• HyTech
• GAIO

This page was built for publication: Optimal semicomputable approximations to reachable and invariant sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642902)