Viability theory
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Reachability analysis of dynamical systems having piecewise-constant derivatives
Theoretical Computer Science - Special issue on hybrid systems
&egr;-approximation of differential inclusions
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Computability on subsets of Euclidean space I: closed and compact subsets
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computable analysis: an introduction
Computable analysis: an introduction
What Will Be Eventually True of Polynomial Hybrid Automata?
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Perturbed Turing Machines and Hybrid Systems
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Computability on subsets of metric spaces
Theoretical Computer Science - Topology in computer science
Languages and tools for hybrid systems design
Foundations and Trends in Electronic Design Automation
Electronic Notes in Theoretical Computer Science (ENTCS)
Effectivity on Continuous Functions in Topological Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Computability and the morphological complexity of some dynamics on continuous domains
Theoretical Computer Science
Effective Computation for Nonlinear Systems
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Contract-Based Design for Computation and Verification of a Closed-Loop Hybrid System
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
On the Continuity of Effective Multifunctions
Electronic Notes in Theoretical Computer Science (ENTCS)
The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
On computably locally compact hausdorff spaces
Mathematical Structures in Computer Science
Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Dynamic distributed intrusion detection for secure multi-robot systems
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Computability on subsets of locally compact spaces
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Robust computations with dynamical systems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Semantics and Computability of the Evolution of Hybrid Systems
SIAM Journal on Control and Optimization
Safety verification of non-linear hybrid systems is quasi-semidecidable
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Computation with perturbed dynamical systems
Journal of Computer and System Sciences
Safety verification of non-linear hybrid systems is quasi-decidable
Formal Methods in System Design
| Hi-index | 5.23 |
The computation of reachable sets of nonlinear dynamic and control systems is an important problem of systems theory. In this paper we consider the computability of reachable sets using Turing machines to perform approximate computations. We use Weihrauch's type-two theory of effectivity for computable analysis and topolgy, which provides a natural setting for performing computations on sets and maps. The main result is that the reachable set is lower-computable, but is only outer-computable if it equals the chain-reachable set. In the course of the analysis, we extend the computable topology theory to locally-compact Hausdorff spaces and semicontinuous set-valued maps, and provide a framework for computing approximations.