R. Alur and D. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

T. [. Beauquier, A. Crolard, and . Slissenko, A predicate logic framework for mechanical verification of real-time Gurevich Abstract State Machines: A case study with PVS, 2000.

D. Beauquier and A. Slissenko, Decidable classes of the verification problem in a timed predicate logic, Proc. of the 12th Intern. Symp. on Fundamentals of Computation Theory (FCT'99), pp.100-111, 1999.
DOI : 10.1007/3-540-48321-7_7

]. D. Bs02a, A. Beauquier, and . Slissenko, Decidable verification for reducible timed automata specified in a first order logic with time, Theoretical Computer Science, vol.275, issue.12, pp.347-388, 2002.

D. Beauquier and A. Slissenko, A first order logic for specification of timed algorithms: basic properties and a decidable class, Annals of Pure and Applied Logic, vol.113, issue.1-3, pp.1-313, 2002.
DOI : 10.1016/S0168-0072(01)00049-5

]. Y. Gur95 and . Gurevich, Evolving algebra 1993: Lipari guide, Specification and Validation Methods, pp.9-93, 1995.

]. Y. Gur00 and . Gurevich, Sequential abstract-state machines capture sequential algorithms, ACM Transactions on Computational Logic, vol.1, issue.1, pp.77-111, 2000.

]. A. Sli99 and . Slissenko, Minimizing entropy of knowledge representaion, Proc. of the 2nd International Conf. on Computer Science and Information Technologies, pp.2-6, 1999.

]. A. Sli03 and . Slissenko, A logic framework for verification of timed distributed algorithms. Version of, Complexity and Logic, 2001.

G. Tel, Introduction to Distributed Algorithms, 2000.
DOI : 10.1017/CBO9781139168724

URL : http://dx.doi.org/10.1016/s0898-1221(97)90063-8

]. V. Wei99 and . Weispfenning, Mixed real-integer linear quantifier elimination, Proc. of the 1999 Int. Symp. on Symbolic and Algebraic Computations (ISSAC'99), pp.129-136, 1999.