Abstract
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.
Article
This research was done during the author’s visit to TIFR, Bombay, supported by an extension of a UNU/IIST fellowship. Mailing address: str. Academiei 14, Bucharest, Romania, R0-70109
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Alur and D.L. Dill. A theory of timed automata, Theoretical Computer Science, 126, 183–235, 1994.
R. Alur, L. Fix and T.A. Henzinger. A determinizable class of timed automata, Theoretical Computer Science, 211, 253–273, 1999.
E. Asarin, P. Caspi and O. Maler, A Kleene Theorem for Timed Automata, in G. Winskel (Ed.) Proc. LICS’97, 160–171, 1997.
P. Bouyer and A. Petit, Decomposition and composition of timed automata, to appear in Proc. of ICALP’ 99, LNCS series, 1999.
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.
C. Dima. Complementation of real-time automata, submitted to FCT&TCS’99, available at http://funinf.math.unibuc.ro/~cdima/work/mfcs.ps.gz.
C. Dima. Automata and Regular Expressions for Real-Time Languages, submitted to AFL’99, abstract available at http://funinf.math.unibuc.ro/~cdima/work/abstract.ps.gz.
C. Dima. Removing transitions from event-clock automata, in preparation, available at http://funinf.math.unibuc.ro/~cdima/work/eps-elim.ps.gz.
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.
John E. Hopcroft and Jeffrey D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley/Narosa Publishing House, eighth edition, New Delhi, 1992.
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.
W. Thomas. Automata on infinite objects, in J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol B, 133–191, Elsevier, Amsterdam, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dima, C. (1999). Kleene theorems for event-clock automata. In: Ciobanu, G., Păun, G. (eds) Fundamentals of Computation Theory. FCT 1999. Lecture Notes in Computer Science, vol 1684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48321-7_17
Download citation
DOI: https://doi.org/10.1007/3-540-48321-7_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66412-3
Online ISBN: 978-3-540-48321-2
eBook Packages: Springer Book Archive