Theoretical Computer Science
Automata, Circuits, and Hybrids: Facets of Continuous Time
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Timing analysis of asynchronous circuits using timed automata
CHARME '95 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Functional Specification of Real-Time and Hybrid Systems
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
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
Theoretical Computer Science
Understanding Basic Automata Theory in the Continuous Time Setting
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
| Hi-index | 0.00 |
To what mathematical models do digital computer circuits belong? In particular: (i) (Feedback reliability.) Which cyclic circuits should be accepted? In other words, under which conditions is causally faithful the propagation of signals along closed cycles of the circuit? (ii) (Comparative power and completeness.) What are the appropriate primitives upon which circuits may be (or should be) assembled? There are well-known answers to these questions for circuits operating in discrete time, and they point on the exclusive role of the unit-delay primitive. For example: (i) If every cycle in the circuit N passes through a delay, then N is feedback reliable. (ii) Every finite-memory operator F is implementable in a circuit over unit-delay and pointwise boolean gates. In what form, if any, can such phenomena and results be extended to circuits operating in continuous time? This is the main problem considered (and, hopefully, solved to some extent) in this paper. In order to tackle the problems one needs more insight into specific properties of continuous time signals and operators that are not visible at discrete time.