1. The algorithmic analysis of hybrid systems;Alur;Theoret. Comput. Sci.,1995
2. Hybrid automata;Alur,1993
3. A theory of timed automata;Alur;Theoret. Comput. Sci.,1994
4. D. Beauquier, A. Slissenko, On semantics of algorithms with continuous time, Technical Report 97-15, Revised version, Department of Informatics, 1997, University Paris 12, Available at http://www.eecs.umich.edu/gasm/ and at http://www.univ-paris12.fr/lacl/.
5. The railroad crossing problem;Beauquier,1997