A domain-theoretic approach to computability on the real line
Theoretical Computer Science - Special issue on real numbers and computers
Concrete models of computation for topological algebras
Theoretical Computer Science - Special issue on computability and complexity in analysis
Computable analysis: an introduction
Computable analysis: an introduction
A Logical Approach to Specification of Hybrid Systems
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Hybrid Systems
Towards Refining Temporal Specifications into Hybrid Systems
Hybrid Systems
Agent Based Velocity Control of Highway Systems
Hybrid Systems IV
Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Characteristic Properties of Majorant-Computability over the Reals
Proceedings of the 12th International Workshop on Computer Science Logic
ΣK-constraints for hybrid systems
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
| Hi-index | 0.00 |
We investigate the concept of generalised computability of operators and functionals defined on the set of continuous functions, firstly introduced in [9]. By working in the reals, with equality and without equality, we study properties of generalised computable operators and functionals. Also we propose interesting applications to formalisation of hybrid systems. We obtain some class of hybrid systems, which trajectories are computable in the sense of computable analysis.