C. R. Alur, N. Courcoubetis, T. A. Halbwachs, P. Henzinger, X. Ho et al., The algorithmic analysis of hybrid systems, Theoretical Computer Science, vol.138, issue.1, pp.3-34, 1995.
DOI : 10.1016/0304-3975(94)00202-T

B. Boigelot, L. Bronne, and S. Rassart, An improved reachability analysis method for strongly linear hybrid systems (extended abstract), Proceedings of the 9th Int. Conf. on Computer-Aided Verification (CAV'97, pp.167-177, 1997.
DOI : 10.1007/3-540-63166-6_18

B. Boigelot, F. Herbreteau, and S. Jodogne, Hybrid Acceleration Using Real Vector Automata, Proc. of the 15th Int. Conf. on Computer-Aided Verification (CAV'03), pp.193-205, 2003.
DOI : 10.1007/978-3-540-45069-6_19
URL : https://hal.archives-ouvertes.fr/inria-00335915

B. Boigelot, S. Jodogne, and P. Wolper, An effective decision procedure for linear arithmetic over the integers and reals, ACM Transactions on Computational Logic, vol.6, issue.3, pp.614-633, 2005.
DOI : 10.1145/1071596.1071601

S. Bardin, J. Leroux, A. Finkel, and L. Petrucci, FAST: Fast Acceleration of Symbolic Transition Systems, Proc. 15th Int. Conf. on Computer-Aided Verification, volume 2725 of Lect. Notes in Comp. Sc, pp.118-121, 2003.
DOI : 10.1007/978-3-540-45069-6_12
URL : https://hal.archives-ouvertes.fr/hal-00084185

P. Bouyer, F. Laroussinie, and P. Reynier, Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems, Proc. of the 3rd IntBoi98] B. Boigelot. Symbolic Methods for Exploring Infinite State Spaces, pp.112-126, 1998.
DOI : 10.1007/11603009_10

P. Bouyerby03, ]. J. Bengtsson, and W. Yi, On clock difference constraints and termination in reachability analysis of timed automata Multiple counters automata, safety analysis and Presburger arithmetic, Proc. of 20th Ann. Symp. Theoretical Aspects of Computer Science Proc. of 5th Int. Conf. on Formal Engineering Methods (ICFEM'03) Proc. of 10th Int. Conf. on Computer-Aided Verification (CAV'98)CJ99] H. Comon and Y. Jurski. Timed automata and the theory of real numbers Proc. 10th Int. Conf. Concurrency Theory (CONCUR'99), pp.491-503, 1998.

T. A. Henzinger, The theory of hybrid automata, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pp.278-292, 1996.
DOI : 10.1109/LICS.1996.561342

P. Z. Revesz, A closed-form evaluation for Datalog queries with integer (gap)-order constraints, Theoretical Computer Science, vol.116, issue.1, pp.117-149, 1993.
DOI : 10.1016/0304-3975(93)90222-F

V. Weispfenning, Mixed real-integer linear quantifier elimination, ISSAC: Proceedings of the ACM SIGSAM Int. Symp. on Symbolic and Algebraic Computation, pp.129-136, 1999.
DOI : 10.1145/309831.309888