P. Cerný, T. A. Henzinger, and A. Radhakrishna, Quantitative simulation games, EMAP 2010, pp.42-60, 2010.

P. Cerný, T. A. Henzinger, and A. Radhakrishna, Simulation distances, CON- CUR 2010, pp.253-268, 2010.

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

L. De-alfaro, R. Majumdar, V. Raman, and M. Stoelinga, Game Relations and Metrics, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.99-108, 2007.
DOI : 10.1109/LICS.2007.22

J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden, Metrics for Labeled Markov Systems, In CONCUR LNCS, vol.1664, pp.258-273, 1999.
DOI : 10.1007/3-540-48320-9_19

J. Desharnais, F. Laviolette, and M. Tracol, Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games, 2008 Fifth International Conference on Quantitative Evaluation of Systems, pp.264-273, 2008.
DOI : 10.1109/QEST.2008.42

U. Fahrenberg, A. Legay, and C. R. Thrane, The quantitative linear-time???branching-time spectrum, FSTTCS 2011 of LIPIcs, pp.103-114
DOI : 10.1016/j.tcs.2013.07.030

URL : https://hal.archives-ouvertes.fr/hal-01087368

U. Fahrenberg, C. R. Thrane, and K. G. Larsen, Distances for Weighted Transition Systems: Games and Properties, QAPL 2011, pp.134-147, 2011.
DOI : 10.4204/EPTCS.57.10

URL : https://hal.archives-ouvertes.fr/hal-01088053

A. Giacalone, C. Jou, and S. A. Smolka, Algebraic reasoning for probabilistic concurrent systems, Proc. IFIP TC2 Working Conference on Programming Concepts and Methods, pp.443-458, 1990.

A. Thomas, J. Henzinger, and . Otop, From model checking to model measuring, CONCUR 2013, pp.273-287, 2013.

B. Jacobs, Exercises in Coalgebraic Specification, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, pp.237-280, 2000.
DOI : 10.1007/3-540-47797-7_7

B. Jacobs, Introduction to coalgebra. towards mathematics of states and observations, p.2012

A. Kiehn and S. Arun-kumar, Amortised Bisimulations, LNCS, vol.7, issue.2, pp.320-334, 2005.
DOI : 10.1007/3-540-10235-3

R. Milner, Communication and concurrency, 1989.

M. Nielsen and C. Clausen, Bisimulation, games, and logic, In Results and Trends in Theoretical Computer Science LNCS, vol.812, pp.289-306, 1994.
DOI : 10.1007/3-540-58131-6_54

D. M. Park, Concurrency and automata on infinite sequences, Theoretical Computer Science, 5th Gl-Conf, pp.167-183, 1981.
DOI : 10.1007/BFb0017309

D. Romero-hernández and D. De-frutos-escrig, Defining Distances for All Process Semantics, FMOODS/FORTE 2012, pp.169-185, 2012.
DOI : 10.1007/978-3-642-30793-5_11

D. Romero-hernández and D. De-frutos-escrig, Distances between Processes: A Pure Algebraic Approach, WADT 2012, pp.265-282, 2012.
DOI : 10.1007/978-3-642-37635-1_16

J. J. Rutten, Universal coalgebra: a theory of systems, Theoretical Computer Science, vol.249, issue.1, pp.3-80, 2000.
DOI : 10.1016/S0304-3975(00)00056-6

D. Sangiorgi, Advanced topics in bisimulation and coinduction. Cambridge Tracts in Theoretical Computer Science, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00907322

C. Stirling, The joys of bisimulation, MFCS 1998, pp.142-151, 1998.
DOI : 10.1007/BFb0055763

C. Stirling, Bisimulation, modal logic and model checking games, Logic Journal of IGPL, vol.7, issue.1, pp.103-124, 1999.
DOI : 10.1093/jigpal/7.1.103

M. Ying and M. Wirsing, Approximate Bisimilarity, LNCS, vol.1816, pp.309-322, 2000.
DOI : 10.1007/3-540-45499-3_23