Kleene theorems for event-clock automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1684, Issue , 1999, Pages 215-225

  Dima, Cătălin ^a  

^a UNIVERSITY OF BUCHAREST   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

CLOCKS; EQUIVALENCE CLASSES; PATTERN MATCHING; SEMANTICS;

COMPOSITIONAL SEMANTICS; KLEENE THEOREM; REGULAR EXPRESSIONS; STATE SEQUENCES;

AUTOMATA THEORY;

EID: 84956862812     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48321-7_17     Document Type: Conference Paper

References (12)

1. R. Alur and D.L. Dill. A theory of timed automata, Theoretical Computer Science, 126, 183-235, 1994.
2. R. Alur, L. Fix and T.A. Henzinger. A determinizable class of timed automata, Theoretical Computer Science, 211, 253-273, 1999.
3. E. Asarin, P. Caspi and O. Maler, A Kleene Theorem for Timed Automata, in G. Winskel (Ed.) Proc. LICS'97, 160-171, 1997.
4. P. Bouyer and A. Petit, Decomposition and composition of timed automata, to appear in Proc. of ICALP '99, LNCS series, 1999.
5. C. Dima. Real-time automata and their class of accepted languages, draft of a UNU/IIST report, available at http://funinf.math.unibuc.ro/~cdima/work/expressive.ps.gz.
6. C. Dima. Complementation of real-time automata, submitted to FCT&TCS'99, available at http://funinf.math.unibuc.ro/~cdima/work/mfcs.ps.gz.
7. C. Dima. Automata and Regular Expressions for Real-Time Languages, submit- ted to AFL'99, abstract available at http://funinf.math.unibuc.ro/~cdima/work/abstract.ps.gz.
8. C. Dima. Removing ε-transitions from event-clock automata, in preparation, available at http://funinf.math.unibuc.ro/~cdima/work/eps-elim.ps.gz.
9. T.A. Henzinger, J.-F. Raskin and P.-Y. Schobbens. The regular real-time languages, in Proceedings of the 25-th International Colloquium on Automata, Languages and Programming LNCS series, Springer Verlag, 1998.
10. John E. Hopcroft and Jeffrey D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley/Narosa Publishing House, eighth edition, New Delhi, 1992.
11. J.-F. Raskin and P.-Y. Schobbens. State-clock logic: a decidable real-time logic, in Hybrid and Real-Time Systems, LNCS 1201, 33-47, Springer Verlag, 1997.
12. W. Thomas. Automata on infinite objects, in J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol B, 133-191, Elsevier, Amsterdam, 1997.