Handbook of theoretical computer science (vol. B)
Real-time logics: complexity and expressiveness
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Regular Real-Time Languages
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
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
Product Interval Automata: A Subclass of Timed Automata
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
State Clock Logic: A Decidable Real-Time Logic
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
A Determinizable Class of Timed Automata
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
A Decidable Fixpoint Logic for Time-Outs
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Undecidability Results for Timed Automata with Silent Transitions
Fundamenta Informaticae
| Hi-index | 0.00 |
We show that the class of Event Recording Automata [2] admit a logical characterisation via an unrestricted monadic second order logic interpreted over timed words. We point out the closure properties corresponding to existential quantification in the logic. A timed temporal logic considered earlier in the literature is shown to be expressively complete with respect to our monadic logic. The results in this paper extend smoothly to the class of event clock automata (also introduced in [2]).