Computability
An introduction to analysis
Selected papers of the workshop on Topology and completion in semantics
Handbook of logic in computer science (vol. 4)
Handbook of logic in computer science (vol. 3)
Real number computability and domain theory
Information and Computation
A domain-theoretic approach to computability on the real line
Theoretical Computer Science - Special issue on real numbers and computers
Computability on Continuou, Lower Semi-continuous and Upper Semi-continuous Real Functions
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
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
Reachability Verification for Hybrid Automata
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Characteristic Properties of Majorant-Computability over the Reals
Proceedings of the 12th International Workshop on Computer Science Logic
Complexity theory on real numbers and functions
Proceedings of the 6th GI-Conference on Theoretical Computer Science
Generalised Computability and Applications to Hybrid Systems
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Semantic Characterisations of Second-Order Computability over the Real Numbers
CSL '01 Proceedings of the 15th 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
Towards computability of higher type continuous data
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
| Hi-index | 0.00 |
Based on an effective theory of continuous domains, notions of computability for operators and real-valued functionals defined on the class of continuous functions are introduced. Definability and semantic characterisation of computable functionals are given. Also we propose a recursion scheme which is a suitable tool for formalisation of complex systems, such as hybrid systems. In this framework the trajectories of continuous parts of hybrid systems can be represented by computable functionals.