Handbook of theoretical computer science (vol. B)
Theoretical Computer Science
Event-clock automata: a determinizable class of timed automata
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Decomposition and Composition of Timed Automata
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Regular Real-Time Languages
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
State Clock Logic: A Decidable Real-Time Logic
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
A Kleene theorem for timed automata
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
CONCUR 2005 - Concurrency Theory
Event clock automata: from theory to practice
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Undecidability Results for Timed Automata with Silent Transitions
Fundamenta Informaticae
Hi-index | 0.00 |
We define some class of regular expressions equivalent to event-clock automata. It is shown that regular expressions cannot be given a compositional semantics in terms of timed state sequences. We introduce a modified version of timed state sequences supporting a partial operation of concatenation on which we may build the semantics of regular expressions. A forgetting map then induces a semantics in terms of the classic version of timed state sequences. We also define several types of languages of automata in terms of classic or modified timed state sequences. Two Kleene theorems, one for each type of timed state sequences, relating expressions and event-clock automata are proved.