Abstract
We examine some extensions of the basic model, due to Alur and Dill, of real-time automata (RTA). Our model, controlled real-time automata, is a parameterized family of real-time automata with some additional features like clock stopping, variable clock velocities and periodic tests. We illustrate the power of controlled automata by presenting some languages that can be recognized deterministically by such automata, but cannot be recognized non-deterministically by any other previously introduced class of timed automata (even with ɛ-transitions). On the other hand, due to carefully chosen restrictions, controlled automata conserve basic properties of RTA: the emptiness problem is decidable and for each fixed parameter the family of recognized real-time languages is closed under boolean operations.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Rajeev Alur, Costas Courcoubetis, and David Dill. Model-checking in real-time systems. Information and Computation, 104:2–34, 1993.
Rajeev Alur and David L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183–235, 1994.
Rajeev Alur, Limor Fix, and Thomas A. Henzinger. A determinizable class of timed automata. In Proceedings of CAV'94, volume 818 of Lecture Notes in Comp. Sci., pages 1–13. Springer Verlag, 1994.
Rajeev Alur and Thomas A. Henzinger. Back to the future: Towards a theory of timed regular languages. In Proceed. of 33th IEEE Symp. of Fundamentals of Computer Science, pages 177–186, 1992.
Christian Choffrut and Massimiliano Goldwurm. Timed automata with periodic clock constraints. Technical report, University of Milano, 1998.
V. Diekert, P. Gastin, and A. Petit. Removing ɛ-transitions in timed automata. In Proceedings of STACS'97, volume 1200 of Lecture Notes in Comp. Sci., pages 583–594. Springer Verlag, 1997.
V. Gupta, T.A. Henzinger, and Rt. Jagadeesan. Robust timed automata. In Proceedings of HART'97, volume 1201 of Lecture Notes in Comp. Sci., pages 331–345. Springer Verlag, 1997.
T.A. Henzinger. The theory of hybrid automata. In Proceedings of LICS'96, pages 278–292, 1996.
Philippe Hermann. Automates temporisés et reconnaissabilité. Mémoire de DEA, LIAFA, Université Paris VII, 1997. extended version of [10].
Philippe Hermann. Timed automata and recognizability. Information Processing Letters, 1998. to appear.
W. Thomas. Automata on infinite objects. In J. van Leeuven, editor, Handbook of Theoretical Computer Science, volume B, pages 133–191. Elsevier Science, 1990.
Th. Wilke. Specifying timed step sequences in powerful decidable logics and timed automata. In Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 863 of Lecture Notes in Comp. Sci. Springer Verlag, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demichelis, F., Zielonka, W. (1998). Controlled timed automata. In: Sangiorgi, D., de Simone, R. (eds) CONCUR'98 Concurrency Theory. CONCUR 1998. Lecture Notes in Computer Science, vol 1466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055641
Download citation
DOI: https://doi.org/10.1007/BFb0055641
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64896-3
Online ISBN: 978-3-540-68455-8
eBook Packages: Springer Book Archive