Complexity theory of real functions
Complexity theory of real functions
Reachability analysis of dynamical systems having piecewise-constant derivatives
Theoretical Computer Science - Special issue on hybrid systems
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
Complexity and real computation
Complexity and real computation
Introduction to mathematical systems theory: a behavioral approach
Introduction to mathematical systems theory: a behavioral approach
Computable analysis: an introduction
Computable analysis: an introduction
Differential Inclusions: Set-Valued Maps and Viability Theory
Differential Inclusions: Set-Valued Maps and Viability Theory
Beyond HYTECH: Hybrid Systems Analysis Using Interval Numerical Methods
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Verification of Hybrid Systems with Linear Differential Inclusions Using Ellipsoidal Approximations
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
The realizability approach to computable analysis and topology
The realizability approach to computable analysis and topology
Computability on subsets of metric spaces
Theoretical Computer Science - Topology in computer science
Continuity and computability of reachable sets
Theoretical Computer Science
Optimal Semicomputable Approximations to Reachable and Invariant Sets
Theory of Computing Systems
On the expressiveness and decidability of o-minimal hybrid systems
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Foundations of a compositional interchange format for hybrid systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
PHAVer: algorithmic verification of hybrid systems past hytech
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Solutions to hybrid inclusions via set and graphical convergence with stability theory applications
Automatica (Journal of IFAC)
Mathematical and Computer Modelling: An International Journal
Ariadne: dominance checking of nonlinear hybrid automata using reachability analysis
RP'12 Proceedings of the 6th international conference on Reachability Problems
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 | 0.00 |
In this paper we consider the semantics for the evolution of hybrid systems, and the computability of the evolution with respect to these semantics. We show that with respect to lower semantics, the finite-time reachable sets are lower-semicomputable, and with respect to upper semantics, the finite-time reachable sets are upper-semicomputable. We use the framework of type-two Turing computability theory and computable analysis, which deal with obtaining approximation results with guaranteed error bounds from approximate data. We show that, in general, we cannot find a semantics for which the evolution is both lower- and upper-semicomputable, unless the system is free from tangential and corner contact with the guard sets. We highlight the main points of the theory with simple examples illustrating the subtleties involved.