1. Alon, N., Krivelich, M., Newman, I., Szegedy, M.: Regular languages are testable with a constant number of queries. SIAM J. Comput. 30(6), 1842–1862 (2000)
2. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126, 183–235 (1994)
3. Alur, R., Kurshan, R.P., Viswanathan, M.: Membership questions for timed and hybrid automata. In: Proceedings of the 19th IEEE Real-Time Systems Symposium, Madrid, Spain, December 2–4, 1998, pp 254–263, (1998)
4. Alur, R., Torre, S.L., Madhusudan, P.: Perturbed timed automata. In: Morari, M., Thiele, L. (eds.) Hybrid Systems: Computation and Control. Springer, Berlin Heidelberg (2005)
5. Alur, R., Madhusudan, P.: Decision Problems for Timed Automata: A Survey, pp. 1–24. Springer, Berlin Heidelberg (2004)