C. Baier and H. Hermanns, Weak bisimulation for fully probabilistic processes, Proceedings of the 9th International Conference on Computer Aided Verification, pp.119-130, 1997.
DOI : 10.1007/3-540-63166-6_14

L. Chen, Timed processes: Models, axioms and decidability, 1993.

L. De-alfaro, M. Faella, and M. I. Stoelinga, Linear and Branching Metrics for Quantitative Transition Systems, Proceedings of the 31st International Colloquium on Automata, Languages and Programming, pp.97-109, 2004.
DOI : 10.1007/978-3-540-27836-8_11

E. P. De-vink and J. J. Rutten, Bisimulation for probabilistic transition systems: a coalgebraic approach, Theoretical Computer Science, vol.221, issue.1-2, pp.271-293, 1999.
DOI : 10.1016/S0304-3975(99)00035-3

J. I. Hartog, Probabilistic Extensions of Semantical Models, 2002.

Y. Deng and C. Palamidessi, Axiomatizations for Probabilistic Finite-State Behaviors, Proceedings of the 8th International Conference on Foundations of Software Science and Computation Structures, pp.110-124, 2005.
DOI : 10.1007/978-3-540-31982-5_7

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

J. Desharnais, R. Jagadeesan, V. Gupta, and P. Panangaden, The metric analogue of weak bisimulation for probabilistic processes, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.413-422, 2002.
DOI : 10.1109/LICS.2002.1029849

J. Desharnais, R. Jagadeesan, V. Gupta, and P. Panangaden, Metrics for labelled Markov processes, Theoretical Computer Science, vol.318, issue.3, pp.323-35499, 2004.
DOI : 10.1016/j.tcs.2003.09.013

S. Eilenberg, Automata, Languages, and Machines, 1974.

A. Giacalone, C. Jou, and S. A. Smolka, Algebraic reasoning for probabilistic concurrent systems, Proceedings of IFIP WG 2.2/2.3 Working Conference on Programming Concepts and Methods, pp.453-459, 1990.

O. M. Herescu and C. Palamidessi, Probabilistic Asynchronous ??-Calculus, Proceedings of the 3rd International Conference Foundations of Software Science and Computation Structures, pp.146-160, 2000.
DOI : 10.1007/3-540-46432-8_10

URL : http://arxiv.org/pdf/cs/0109002v1.pdf

L. Kantorovich, On the transfer of masses (in Russian), Doklady Akademii Nauk Translated in Management Science, vol.5, issue.51, pp.1-41, 1942.

M. Z. Kwiatkowska and G. J. Norman, Probabilistic metric semantics for a simple language with recursion, Proceedings of 21st International Symposium on Mathematical Foundations of Computer Science, pp.419-430, 1996.
DOI : 10.1007/3-540-61550-4_167

K. G. Larsen and A. Skou, Bisimulation through probabilistic testing, Information and Computation, vol.94, issue.1, pp.1-28, 1991.
DOI : 10.1016/0890-5401(91)90030-6

URL : http://doi.org/10.1016/0890-5401(91)90030-6

R. Milner, Communication and Concurrency, 1989.

M. Mohri, EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS, International Journal of Foundations of Computer Science, vol.14, issue.06, pp.957-982, 2003.
DOI : 10.1142/S0129054103002114

G. J. Norman, Metric Semantics for Reactive Probabilistic Systems, 1997.

A. Philippou, I. Lee, and O. Sokolsky, Weak Bisimulation for Probabilistic Systems, Proceedings of the 11th International Conference on Concurrency Theory, pp.334-349, 2000.
DOI : 10.1007/3-540-44618-4_25

R. Segala, Modeling and verification of randomized distributed real-time systems, 1995.

A. Sokolova and E. De-vink, Probabilistic Automata: System Types, Parallel Composition and Comparison, Validation of Stochastic Systems: A Guide to Current Research, pp.1-43, 2004.
DOI : 10.1007/978-3-540-24611-4_1

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-309, 1955.
DOI : 10.2140/pjm.1955.5.285

F. Van-breugel and J. Worrell, An Algorithm for Quantitative Verification of Probabilistic Transition Systems, Proceedings of the 12th International Conference on Concurrency Theory, pp.336-350, 2001.
DOI : 10.1007/3-540-44685-0_23

F. Van-breugel and J. Worrell, Towards Quantitative Verification of Probabilistic Transition Systems, Proceedings of the 28th International Colloquium Automata, Languages and Programming, pp.421-432, 2001.
DOI : 10.1007/3-540-48224-5_35

F. Van-breugel and J. Worrell, A behavioural pseudometric for probabilistic transition systems, Theoretical Computer Science, vol.331, issue.1, 2004.
DOI : 10.1016/j.tcs.2004.09.035

R. J. Van-glabbeek, S. A. Smolka, and B. Steffen, Reactive, generative, and stratified models of probabilistic processes, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.59-80, 1995.
DOI : 10.1109/LICS.1990.113740

]. L. Vaserstein, Markov processes over denumerable products of spaces, describing large systems of automata, Problems in Information Transmission, vol.5, issue.3, pp.47-52, 1969.

Y. Wang, CCS + time = an interleaving model for real time systems, Proceedings of the 18th Colloquium on Automata, Languages and Programming, pp.217-228, 1991.

M. Ying, Bisimulation indexes and their applications, Theoretical Computer Science, vol.275, issue.1-2, pp.1-68, 2002.
DOI : 10.1016/S0304-3975(01)00124-4

URL : http://doi.org/10.1016/s0304-3975(01)00124-4