Abstract
A commutative complemented Kleene algebra of sets of (positive) real numbers is introduced. For the subalgebra generated by finite unions of rational intervals a normal form is found. These are then applied to the complementation problem for real-time automata.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This research was done during the author’s visit to TIFR, Bombay, supported by an extension of a UNU/IIST fellowship.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
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, in Computer-Aided Verification, LNCS 818:1–13, Springer Verlag, 1994.
R. Alur and T. Henzinger. The benefits of relaxing punctuality, Journal of ACM, 43:116–146, 1996.
E. Asarin, P. Caspi and O. Maler, A Kleene Theorem for Timed Automata, in G. Winskel (Ed.) Proc. LICS’97, p.160–171, 1997.
B. Bérard, V. Diekert, P. Gastin and A. Petit. Characterization of the expressive power of silent transitions in timed automata, Fundamenta Informaticæ, 36:145–182, 1998.
P. Bouyer and A. Petit, Decomposition and composition of timed automata, Proceedings of ICALP’99, LNCS series, 1999.
Ch. Choffrut and M. Goldwurm. Timed automata with periodic clock con-straints, LIAFA report, 1998.
J. H. Conway. Regular Algebra and Finite Machines, Chapman and Hall, 1971.
Dang Van Hung and Wang Ji, On the design of Hybrid Control Systems Using Automata Models, in V. Chandru and V. Vinay (Eds.) FSTTCS, LNCS 1180:156–167, 1996.
R. Dechter, I. Meiri and J. Pearl, Temporal constraint networks, Artificial Intelligence, 49:61–95, 1991.
C. Dima. Timed Regular Expressions, Real-Time Automata and Simple Duration Calculus, draft of a UNU/IIST report, 1998. Available at http://funinf.math.unibuc.ro/~cdima/work/report.ps.gz.
C. Dima. Automata and regular expressions for real-time languages, Proceedings of the AFL’99 workshop, Vasszeczeny, Hungary, 9–13 august 1999.
S. Eilenberg. Automata, Languages, and Machines, Vol. A, Academic Press, 1974.
T.A. Henzinger, J.-F. Raskin and P.-Y. Schobbens. The regular real-time languages, in Proc. 25-th ICALP, 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.
D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events, Information and Computation, 110:366–390, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dima, C. (2000). Real-Time Automata and the Kleene Algebra of Sets of Real Numbers. In: Reichel, H., Tison, S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46541-3_23
Download citation
DOI: https://doi.org/10.1007/3-540-46541-3_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67141-1
Online ISBN: 978-3-540-46541-6
eBook Packages: Springer Book Archive