1. R. Alur, C. Courcoubetis, T.A. Henzinger, P.-H. Ho, Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems, in: R.L. Grossman, A. Nerode, A.P. Ravn, H. Rischel (Eds.), Hybrid Systems, LNCS, vol. 736, Springer-Verlag, 1993, pp. 209–229.
2. Introduction to Automata Theory, Languages, and Computation;Hopcroft,1979
3. A. Puri, P. Varaiya, Decidability of hybrid systems with rectangular differential inclusions, in: D.L. Dill (Ed.), Proceedings of International Conference on Computer Aided Verification (CAV’94), LNCS, vol. 818, Springer-Verlag, 1994, pp. 95–104.
4. M. Fränzle, Analysis of hybrid systems: an ounce of realism can save an infinity of states, in: J. Flum, M. Rodríguez-Artalejo (Eds.), Proceedings of Computer Science Logic (CSL’99), LNCS, vol. 1683, Springer-Verlag, 1999, pp. 126–140.
5. H. Anai, V. Weispfenning, Reach set computations using real quantifier elimination, in: M.D.D. Benedetto, A. Sangiovanni-Vincentelli (Eds.), Proceedings of Hybrid Systems: Computation and Control (HSCC’01), LNCS, vol. 2034, Springer-Verlag, 2001, pp. 232–246.