1. Peter Aczel.Non-Well-Founded Sets}, volume 14 of {\em CSLI Lecture Notes. Center for the Study of Language and Information, Stanford University, 1988.
2. Rajeev Alur and David Dill. Automata for modeling real-time systems. InProc. 17th International Colloquium on Automata, Languages and Programming (ICALP'90), volume 443 ofLecture Notes in Computer Science, pages 322-335. Springer, 1990.
3. A theory of timed automata
4. Luca de Alfaro, Marco Faella, \relax Thomas A. Henzinger, Rapuk Majumdar, and Mariëlla Stoelinga. The element of surprise in timed games. InProc. 14th International Conference on Concurrency Theory (CONCUR'03), volume 2761 ofLecture Notes in Computer Science, pages 142-156. Springer, 2003.
5. Discrete abstractions of hybrid systems