1. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
2. Bouyer, P., Chevalier, F.: On conciseness of extensions of timed automata. Journal of Automata, Languages and Combinatorics 10(4), 393–405 (2005)
3. Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: The cost of punctuality. In: LICS 2007, Wrocław, Poland, pp. 109–118. IEEE Computer Society Press, Los Alamitos (2007)
4. Lecture Notes in Computer Science;P. Bouyer,2006
5. Lecture Notes in Computer Science;P. Bouyer,2008