L. Aceto, I. Fábregas, D. De-frutos-escrig, A. Ingólfsdóttir, and M. Palomino, On the specification of modal systems: A comparison of three frameworks, Science of Computer Programming, vol.78, issue.12, pp.2468-2487, 2013.
DOI : 10.1016/j.scico.2013.02.004

S. S. Bauer, A. David, R. Hennicker, K. G. Larsen, A. Legay et al., Moving from Specifications to Contracts in Component-Based Design, FASE, 2012.
DOI : 10.1007/978-3-642-28872-2_3

S. S. Bauer, U. Fahrenberg, L. Juhl, K. G. Larsen, A. Legay et al., Weighted modal transition systems, Formal Methods in System Design, vol.806, issue.1, pp.193-220, 2013.
DOI : 10.1007/s10703-012-0178-9
URL : https://hal.archives-ouvertes.fr/hal-01087925

S. S. Bauer, U. Fahrenberg, A. Legay, and C. Thrane, General Quantitative Specification Theories with Modalities, In CSR LNCS, vol.7353, 2012.
DOI : 10.1007/978-3-642-30642-6_3
URL : https://hal.archives-ouvertes.fr/hal-01087983

S. S. Bauer, L. Juhl, K. G. Larsen, A. Legay, and J. Srba, Extending modal transition systems with structured labels, Mathematical Structures in Computer Science, vol.92, issue.04, pp.581-617, 2012.
DOI : 10.1145/337244.337261

S. Ben-david, M. Chechik, and S. Uchitel, Merging Partial Behaviour Models with Different Vocabularies
DOI : 10.1007/978-3-642-40184-8_8

N. Bene?, B. Delahaye, U. Fahrenberg, J. K?etínský, and A. Legay, Hennessy- Milner logic with greatest fixed points

N. Bene?, I. ?erná, and J. K?etínský, Modal Transition Systems: Composition and LTL Model Checking, ATVA, 2011.
DOI : 10.1007/978-3-642-24372-1_17

G. Boudol and K. G. Larsen, Graphical versus logical specifications, Theoretical Computer Science, vol.106, issue.1, pp.3-20, 1992.
DOI : 10.1016/0304-3975(92)90276-L
URL : https://hal.archives-ouvertes.fr/inria-00075455

L. Caires and L. Cardelli, A spatial logic for concurrency???II, Theoretical Computer Science, vol.322, issue.3, 2003.
DOI : 10.1016/j.tcs.2003.10.041

L. Cardelli, K. G. Larsen, and R. Mardare, Modular Markovian Logic, LNCS, vol.6756, issue.2, 2011.
DOI : 10.1142/p595
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.5515

L. De-alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, Model checking discounted temporal properties, Theoretical Computer Science, vol.345, issue.1, pp.139-170, 2005.
DOI : 10.1016/j.tcs.2005.07.033

L. De-alfaro, M. Faella, and M. Stoelinga, Linear and Branching System Metrics, IEEE Transactions on Software Engineering, vol.35, issue.2, pp.258-273, 2009.
DOI : 10.1109/TSE.2008.106

L. De-alfaro and T. A. Henzinger, Interface automata, ESEC / SIGSOFT FSE, 2001.

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

U. Fahrenberg, M. Acher, A. Legay, and A. W?sowski, Sound Merging and Differencing for Class Diagrams, In FASE LNCS, vol.8411, 2014.
DOI : 10.1007/978-3-642-54804-8_5
URL : https://hal.archives-ouvertes.fr/hal-01087323

U. Fahrenberg and A. Legay, The quantitative linear-time? branching-time spectrum Online first, Th. Comp. Sci, 2014.

U. Fahrenberg, A. Legay, and L. Traonouez, Structural Refinement for the Modal nu-Calculus, ICTAC, 2014.
DOI : 10.1007/978-3-319-10882-7_11
URL : https://hal.archives-ouvertes.fr/hal-01087295

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

M. Hennessy, Acceptance trees, Journal of the ACM, vol.32, issue.4, pp.896-928, 1985.
DOI : 10.1145/4221.4249

T. A. Henzinger, R. Majumdar, and V. S. Prabhu, Quantifying Similarities Between Timed Systems, In FORMATS LNCS, vol.3829, 2005.
DOI : 10.1007/11603009_18
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.6464

T. A. Henzinger and J. Sifakis, The Embedded Systems Design Challenge, In FM LNCS, vol.4085, 2006.
DOI : 10.1007/11813040_1

M. Huth and M. Z. Kwiatkowska, Quantitative analysis and model checking, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, 1997.
DOI : 10.1109/LICS.1997.614940

B. Jacobs and E. Poll, A Logic for the Java Modeling Language JML, In FASE LNCS, vol.2029, 2001.
DOI : 10.1007/3-540-45314-8_21

B. Klin and V. Sassone, Structural operational semantics for stochastic and weighted transition systems, Information and Computation, vol.227, pp.58-83, 2013.
DOI : 10.1016/j.ic.2013.04.001

K. G. Larsen, Proof systems for satisfiability in Hennessy-Milner Logic with recursion, Theoretical Computer Science, vol.72, issue.2-3, pp.265-288, 1990.
DOI : 10.1016/0304-3975(90)90038-J

K. G. Larsen and B. Thomsen, A modal process logic, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science, 1988.
DOI : 10.1109/LICS.1988.5119

K. G. Larsen and L. Xinxin, Equation solving using modal transition systems, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, 1990.
DOI : 10.1109/LICS.1990.113738

B. Liskov and J. M. Wing, A behavioral notion of subtyping, ACM Transactions on Programming Languages and Systems, vol.16, issue.6, pp.1811-1841, 1994.
DOI : 10.1145/197320.197383

M. Mio, Probabilistic modal mu-calculus with independent product, FOSSACS, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00763451

C. Morgan and A. Mciver, A probabilistic temporal calculus based on expectations, Formal Methods, 1997.

J. Raclet, Residual for Component Specifications, Electronic Notes in Theoretical Computer Science, vol.215, 2007.
DOI : 10.1016/j.entcs.2008.06.023
URL : https://hal.archives-ouvertes.fr/inria-00141898

D. Romero-hernández and D. De-frutos-escrig, Defining Distances for All Process Semantics, LNCS, vol.7273, 2012.
DOI : 10.1007/978-3-642-30793-5_11

S. Uchitel and M. Chechik, Merging partial behavioural models, SIGSOFT FSE, 2004.

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

P. ?erný, T. A. Henzinger, and A. Radhakrishna, Simulation distances, Theoretical Computer Science, vol.413, issue.1, pp.21-35, 2012.
DOI : 10.1016/j.tcs.2011.08.002