1. Artemov, S.N., Davoren, J.M., Nerode, A.: Logic, Topological Semantics and Hybrid Systems. In: International Conference on Decision and Control, CDC 1997, vol. 1, pp. 698–701. IEEE Press, Los Alamitos (1997)
2. Balluchi, A., Casagrande, A., Collins, P., Ferrari, A., Villa, T., Sangiovanni-Vincentelli, A.L.: Ariadne: A Framework for Reachability Analysis of Hybrid Automata. In: Symposium on Mathematical Theory of Networks and Systems (MTNS 2006), Kyoto, Japan (July 2006) (to appear)
3. Brattka, V., Presser, G.: Computability on subsets of metric spaces. Theoretical Computer Science 305(1-3), 43–76 (2003)
4. Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. AMC Transactions On Programming Languages And Systems 8(2), 244–263 (1986)
5. Clarke, E.M., Draghicescu, I.A.: Expressibility Results for Linear-Time and Branching-Time Logics. In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, London, UK, pp. 428–437. Springer, Heidelberg (1989)