1. E. Ábrahfm-Mumm, U. Hannemann, and M. Steffen. Verification of hybrid systems: Formalization and proof rules in PVS. Technical Report TR-ST-01-1, Lehrstuhl für Software-Technologie, Institut für Informatik und praktische Mathematik, Christian-Albrechts-Universität Kiel, Jan. 2001.
2. R. Alur, C. Courcoubetis, T. Henzinger, P. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3–34, 1995. A preliminary version appeared in the proceedings of 11th. International Conference on Analysis and Optimization of Systems: Discrete Event Systems (LNCI 199).
3. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:252–235, 1994.
4. R. Alur, T. A. Henzinger, and P. Ho. Automatic symbolic verification of embedded systems. In Proc. 14th Annual Real-Time Systems Symposium, pages 2–11. IEEE Computer Society Press, 1993.
5. Lect Notes Comput Sci;M. Archer,1997