ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
On translations of temporal logic of actions into monadic second-order logic
Theoretical Computer Science
Journal of the ACM (JACM)
A really abstract concurrent model and its temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Proceedings of the International Workshop on Hybrid and Real-Time Systems
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
From Finite Automata toward Hybrid Systems (Extended Abstract)
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Origins and Metamorphoses of The Trinity: Logic, Nets, Automata
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
Streams, Stream Transformers and Domain Representations
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
Computability of analog networks
Theoretical Computer Science
Understanding Basic Automata Theory in the Continuous Time Setting
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Modelling of Complex Systems: Systems as Dataflow Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part II
On the expressiveness of MTL variants over dense time
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
A theory of sampling for continuous-time metric temporal logic
ACM Transactions on Computational Logic (TOCL)
Modelling of Complex Systems: Systems as Dataflow Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Understanding Basic Automata Theory in the Continuous Time Setting
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
| Hi-index | 5.23 |
The principal objective of this paper is to lift basic concepts of the classical automata theory from discrete to continuous (real) time. It is argued that the set of finite memory retrospective functions is the set of functions realized by finite state devices. We show that the finite memory retrospective functions are speed-independent, i.e., they are invariant under 'stretchings' of the time axis. Therefore, such functions cannot deal with metrical aspects of the reals.We classify and analyze phenomena which appear at continuous time and are invisible at discrete time.