Abstract
We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a given timed automaton is determinizable or whether the complement of a timed regular language is timed regular. We show that the problem of the minimization of the number of clocks of a timed automaton is undecidable. It is also undecidable whether the shuffle of two timed regular languages is timed regular. We show that in the case of timed Büchi automata accepting infinite timed words some of these problems are Π1 1-hard, hence highly undecidable (located beyond the arithmetical hierarchy).
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.
References
Alur, R., Dill, D.: A Theory of Timed Automata. Theoretical Computer Science 126, 183–235 (1994)
Alur, R., Madhusudan, P.: Decision Problems for Timed Automata: A Survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 1–24. Springer, Heidelberg (2004)
Abdulla, P.A., Deneux, J., Ouaknine, J., Worrell, J.: Decidability and Complexity Results for Timed Automata via Channel Machines. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1089–1101. Springer, Heidelberg (2005)
Asarin, E.: Challenges in Timed Languages, From Applied Theory to Basic Theory. Bulletin of the European Association for Theoretical Computer Science 83, 106–120 (2004)
Asarin, E., Caspi, P., Maler, O.: Timed Regular Expressions. Journal of the ACM 49(2), 172–206 (2002)
Dima, C.: Timed Shuffle Expressions. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 95–109. Springer, Heidelberg (2005)
Finkel, O.: Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations. RAIRO-Theoretical Informatics and Applications 37(2), 115–126 (2003)
Finkel, O.: On Decision Problems for Timed Automata. Bulletin of the European Association for Theoretical Computer Science 87, 185–190 (2005)
Finkel, O.: On the Shuffle of Timed Regular languages. Bulletin of the European Association for Theoretical Computer Science 88, 182–184 (2006)
Henzinger, T.A., Kopke, P.W., Wong-Toi, H.: The Expressive Power of Clocks. In: Fülöp, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 417–428. Springer, Heidelberg (1995)
Ouaknine, J., Worrell, J.: On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. In: The Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, LICS 2004, Turku, Finland, pp. 54–63. IEEE Computer Society, Los Alamitos (2004)
Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)
Tripakis, S.: Folk Theorems on the Determinization and Minimization of Timed Automata. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol. 2791, pp. 182–188. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Finkel, O. (2006). Undecidable Problems About Timed Automata. In: Asarin, E., Bouyer, P. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2006. Lecture Notes in Computer Science, vol 4202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11867340_14
Download citation
DOI: https://doi.org/10.1007/11867340_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45026-9
Online ISBN: 978-3-540-45031-3
eBook Packages: Computer ScienceComputer Science (R0)