Abstract
Timed automata were introduced by Alur and Dill in the early 1990s and have since become the most prominent modelling formalism for real-time systems. A fundamental limit to the algorithmic analysis of timed automata, however, results from the undecidability of the universality problem: does a given timed automaton accept every timed word? As a result, much research has focussed on attempting to circumvent this difficulty, often by restricting the class of automata under consideration, or by altering their semantics.
In this paper, we study the decidability of universality for classes of timed automata with minimal resources. More precisely, we consider restrictions on the number of states and clock constants, as well as the size of the event alphabet. Our main result is that universality remains undecidable for timed automata with a single state, over a single-event alphabet, and using no more than three distinct clock constants.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adams, S.: On the Undecidability of Universality for Timed Automata with Minimal Resources. MSc Thesis, Oxford University (2006)
Alur, R., Courcoubetis, C., Dill, D.: Model-Checking for Real-Time Systems. In: Proceedings of LICS 1990, pp. 414–425. IEEE Computer Society Press, Los Alamitos (1990)
Alur, R., Dill, D.: A Theory of Timed Automata. Theoretical Computer Science 126, 183–235 (1994)
Alur, R., Fix, L., Henzinger, T.A.: Event-Clock Automata: A Determinizable Class of Timed Automata. Theoretical Computer Science 211, 253–273 (1999)
Alur, R., La Torre, S., Madhusudan, P.: Perturbed Timed Automata. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 70–85. Springer, Heidelberg (2005)
Bošnački, D.: Digitization of Timed Automata. In: Proceedings of FMICS 1999 (1999)
Emmi, M., Majumdar, R.: Decision Problems for the Verification of Real-Time Software. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol. 3927, pp. 200–211. Springer, Heidelberg (2006)
Finkel, A., Schnoebelen, P.: Well-Structured Transition Systems Everywhere! Theoretical Computer Science 256(1-2), 63–92 (2001)
Gupta, V., Henzinger, T.A., Jagadeesan, R.: Robust Timed Automata. In: Maler, O. (ed.) HART 1997. LNCS, vol. 1201, pp. 331–345. Springer, Heidelberg (1997)
Henzinger, T.A., Manna, Z., Pnueli, A.: What Good Are Digital Clocks? In: Kuich, W. (ed.) Automata, Languages and Programming. LNCS, vol. 623, pp. 545–558. Springer, Heidelberg (1992)
Henzinger, T.A., Raskin, J.-F.: Robust Undecidability of Timed and Hybrid Systems. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 145–159. Springer, Heidelberg (2000)
Kaynar, D.K., Lynch, N., Segala, R., Vaandrager, F.: Timed I/O Automata: A mathematical Framework for Modeling and Analyzing Real-Time Systems. In: Proceedings of RTSS 2003, IEEE Computer Society Press, Los Alamitos (2003)
Lynch, N.A., Attiya, H.: Using Mappings to Prove Timing Properties. Distributed Computing 6(2), 121–139 (1992)
Minsky, M.L.: Recursive Unsolvability of Post’s Problem of “Tag” and Other Topics in the Theory of Turing Machines. Annals of Mathematics 74(3), 437–455 (1961)
Ouaknine, J.: Digitisation and Full Abstraction for Dense-Time Model Checking. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol. 2280, pp. 37–51. Springer, Heidelberg (2002)
Ouaknine, J., Worrell, J.: Revisiting Digitization, Robustness, and Decidability for Timed Automata. In: Proceedings of LICS 2003, pp. 198–207. IEEE Computer Society Press, Los Alamitos (2003)
Ouaknine, J., Worrell, J.: Timed CSP = Closed Timed ε-Automata. Nordic Journal of Computing 10, 99–133 (2003)
Ouaknine, J., Worrell, J.: Universality and Language Inclusion for Open and Closed Timed Automata. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol. 2623, pp. 375–388. Springer, Heidelberg (2003)
Ouaknine, J., Worrell, J.: On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap. In: Proceedings of LICS 2004, pp. 54–63. IEEE Computer Society Press, Los Alamitos (2004)
Raskin, J.-F.: Logics, Automata and Classical Theories for Deciding Real Time. PhD thesis, University of Namur (1999)
Taşiran, S., Alur, R., Kurshan, R.P., Brayton, R.K.: Verifying Abstractions of Timed Systems. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 546–562. Springer, Heidelberg (1996)
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
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adams, S., Ouaknine, J., Worrell, J. (2007). Undecidability of Universality for Timed Automata with Minimal Resources. In: Raskin, JF., Thiagarajan, P.S. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2007. Lecture Notes in Computer Science, vol 4763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75454-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-75454-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75453-4
Online ISBN: 978-3-540-75454-1
eBook Packages: Computer ScienceComputer Science (R0)