P. ?erný, T. A. Henzinger, and A. Radhakrishna, Simulation distances, In CONCUR LNCS, vol.6269, pp.253-268, 2010.

K. Chatterjee, L. Doyen, and T. A. Henzinger, Quantitative languages, ACM Transactions on Computational Logic, vol.11, issue.4, 2010.
DOI : 10.1145/1805950.1805953
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.9296

X. Chen and Y. Deng, Game Characterizations of Process Equivalences, APLAS, pp.107-121, 2008.
DOI : 10.1007/3-540-56610-4_89

T. A. Luca-de-alfaro, R. Henzinger, and . Majumdar, Discounting the Future in Systems Theory, ICALP, pp.1022-1037, 2003.
DOI : 10.1007/3-540-45061-0_79

J. Desharnais, F. Laviolette, and M. Tracol, Approximate analysis of probabilistic processes, QEST, pp.264-273, 2008.

L. Doyen, T. A. Henzinger, A. Legay, and D. Ni?kovi?, Robustness of Sequential Circuits, 2010 10th International Conference on Application of Concurrency to System Design, pp.77-84, 2010.
DOI : 10.1109/ACSD.2010.26

A. Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fundamenta Mathematicae, vol.49, pp.129-141, 1961.

A. Ehrenfeucht and J. Mycielski, Positional strategies for mean payoff games, International Journal of Game Theory, vol.59, issue.2, pp.109-113, 1979.
DOI : 10.1007/BF01768705

U. Fahrenberg, K. G. Larsen, and C. Thrane, A quantitative characterization of weighted Kripke structures in temporal logic, Computing and Informatics, vol.29, issue.6+, pp.1311-1324, 2010.

R. Fraïssé, Sur quelques classifications des systèmes de relations. Publications Scientifiques de l'Université d, pp.35-182, 1954.

D. De, F. Escrig, and C. Gregorio-rodríguez, Bi)simulations up-to characterise process semantics, Information and Computation, vol.207, issue.2, pp.146-170, 2009.

D. De, F. Escrig, C. G. Rodríguez, and M. Palomino, On the unification of process semantics: Equational semantics, MFPS, pp.243-267, 2009.

R. W. Hamming, Error Detecting and Error Correcting Codes, Bell System Technical Journal, vol.29, issue.2, pp.147-160, 1950.
DOI : 10.1002/j.1538-7305.1950.tb00463.x
URL : http://campus.unibo.it/10913/1/hamming1950.pdf

A. Thomas, R. Henzinger, V. Majumdar, and . Prabhu, Quantifying similarities between timed systems, FORMATS, pp.226-241, 2005.

A. Thomas, J. Henzinger, and . Sifakis, The embedded systems design challenge, FM, pp.1-15, 2006.

K. G. Larsen, U. Fahrenberg, and C. Thrane, Metrics for weighted transition systems: Axiomatization and complexity, Theoretical Computer Science, vol.412, issue.28, pp.3358-3369, 2005.
DOI : 10.1016/j.tcs.2011.04.003
URL : https://hal.archives-ouvertes.fr/hal-01088055

A. Donald and . Martin, Borel determinacy, Annals of Mathematics, vol.102, issue.2, pp.363-371, 1975.

J. A. Stankovic, I. Lee, A. K. Mok, and R. Rajkumar, Opportunities and obligations for physical computing systems, Computer, vol.38, issue.11, pp.23-31, 2005.
DOI : 10.1109/MC.2005.386

C. Stirling, Modal and temporal logics for processes, Banff Higher Order Workshop, pp.149-237, 1995.
DOI : 10.1007/3-540-60915-6_5

C. Thrane, U. Fahrenberg, and K. G. Larsen, Quantitative analysis of weighted transition systems, The Journal of Logic and Algebraic Programming, vol.79, issue.7, pp.689-703, 2005.
DOI : 10.1016/j.jlap.2010.07.010

J. Van-glabbeek, The linear time - branching time spectrum, Handbook of Process Algebra, pp.3-99, 2001.
DOI : 10.1007/BFb0039066

U. Zwick and M. Paterson, The complexity of mean payoff games, Computing and Combinatorics, pp.1-10, 1995.
DOI : 10.1007/BFb0030814