M. Luca-de-alfaro, M. Faella, and . 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, A. , and T. Henzinger, Interface-based design, Engineering Theories of Software Intensive Systems, pp.83-104, 2005.

D. Charalambos, K. C. Aliprantis, and . Border, Infinite Dimensional Analysis: A Hitchhiker's Guide, 2007.

A. Antonik, M. Huth, K. G. Larsen, U. Nyman, and A. W?sowski, 20 years of modal and mixed specifications, Bulletin of the EATCS, vol.95, pp.94-129, 2008.

A. Basu, S. Bensalem, M. Bozga, B. Caillaud, B. Delahaye et al., Statistical Abstraction and Model-Checking of Large Heterogeneous Systems, Lecture Notes in Computer Science, vol.6117, pp.32-46, 2010.
DOI : 10.1007/978-3-642-13464-7_4
URL : https://hal.archives-ouvertes.fr/hal-01055148

S. Sebastian, U. Bauer, L. Fahrenberg, K. G. Juhl, A. Larsen et al., Quantitative refinement for weighted modal transition systems, MFCS, pp.60-71, 2011.

S. Sebastian, L. Bauer, K. G. Juhl, A. Larsen, J. Legay et al., Extending modal transition systems with structured labels, Mathematical Structures in Computer Science, 2012.

N. Bene?, J. Ivana?ernáivana?ivana?erná, and . K?etínsk´k?etínsk´y, Modal Transition Systems: Composition and LTL Model Checking, Lecture Notes in Computer Science, vol.6996, pp.228-242, 2011.
DOI : 10.1007/978-3-642-24372-1_17

N. Bene?, J. K?etínsk´k?etínsk´y, K. G. Larsen, and J. Srba, Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete, Lecture Notes in Computer Science, vol.5684, pp.112-126
DOI : 10.1007/978-3-642-03466-4_7

M. M. Bonsangue, F. Van-breugel, and J. J. Rutten, Generalized metric spaces: Completion, topology, and powerdomains via the Yoneda embedding, Theoretical Computer Science, vol.193, issue.1-2, pp.1-51, 1998.
DOI : 10.1016/S0304-3975(97)00042-X

T. A. Pavol?ern´ypavol?pavol?ern´pavol?ern´y, A. Henzinger, and . Radhakrishna, Simulation distances, Theoretical Computer Science, vol.413, issue.1, pp.21-35, 2012.

A. Chakrabarti, T. A. Luca-de-alfaro, F. Y. Henzinger, and . Mang, Synchronous and Bidirectional Component Interfaces, Lecture Notes in Computer Science, pp.414-427, 2002.
DOI : 10.1007/3-540-45657-0_34
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.266

K. Chatterjee, R. Luca-de-alfaro, V. Majumdar, and . Raman, Algorithms for Game Metrics, Logical Methods in Computer Science, vol.6, issue.3, 2010.
DOI : 10.2168/LMCS-6(3:13)2010
URL : http://arxiv.org/abs/0809.4326

K. Chatterjee, L. Doyen, and T. A. Henzinger, Expressiveness and closure properties for quantitative languages, Logical Methods in Computer Science, vol.6, issue.3, 2010.
DOI : 10.2168/lmcs-6(3:10)2010
URL : http://arxiv.org/abs/0905.2195

S. Combest, COMponent-Based Embedded Systems design Techniques)

A. Condon, The complexity of stochastic games. Information and Computation, pp.203-224, 1992.

A. David, K. G. Larsen, A. Legay, U. Nyman, and A. W?sowski, Timed I/O automata, Proceedings of the 13th ACM international conference on Hybrid systems: computation and control, HSCC '10, pp.91-100, 2010.
DOI : 10.1145/1755952.1755967
URL : http://vbn.aau.dk/ws/files/58768871/HSCC2010cameraready.pdf

A. Luca-de, Quantitative verification and control via the mu-calculus, Lecture Notes in Computer Science, vol.2761, pp.102-126, 2003.

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

R. Luca-de-alfaro, V. Majumdar, M. Raman, and . Stoelinga, Game Refinement Relations and Metrics, Logical Methods in Computer Science, vol.4, issue.3, 2008.
DOI : 10.2168/LMCS-4(3:7)2008

B. Delahaye, Modular Specification and Compositional Analysis of Stochastic Systems, 2010.
URL : https://hal.archives-ouvertes.fr/tel-00591609

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
URL : http://doi.org/10.1016/j.tcs.2003.09.013

M. Droste and P. Gastin, Weighted automata and weighted logics, Theoretical Computer Science, vol.380, issue.1-2, pp.69-86, 2007.
DOI : 10.1016/j.tcs.2007.02.055
URL : https://hal.archives-ouvertes.fr/hal-00772642

M. Droste, W. Kuich, and H. Vogler, Handbook of Weighted Automata, EATCS Monographs in Theoretical Computer Science, 2009.
DOI : 10.1007/978-3-642-01492-5

M. Droste and G. Rahonis, Weighted automata and weighted logics with discounting, Theoretical Computer Science, vol.410, issue.37, pp.3481-3494, 2009.
DOI : 10.1016/j.tcs.2009.03.029
URL : http://doi.org/10.1016/j.tcs.2009.03.029

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.

U. Fahrenberg, A. Legay, and C. Thrane, The quantitative linear-time?branchingtime spectrum, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.103-114, 2011.

U. Fahrenberg, C. Thrane, and K. G. Larsen, Distances for Weighted Transition Systems: Games and Properties, of Electronic Proceedings in Theoretical Computer Science, pp.134-147, 2011.
DOI : 10.4204/EPTCS.57.10
URL : https://hal.archives-ouvertes.fr/hal-01088053

R. J. Hall, Feature interactions in electronic mail, pp.67-82, 2000.

L. Juhl, K. G. Larsen, and J. Srba, Modal transition systems with weight intervals, The Journal of Logic and Algebraic Programming, vol.81, issue.4, pp.408-421, 2012.
DOI : 10.1016/j.jlap.2012.03.008
URL : http://dx.doi.org/10.1016/j.jlap.2012.03.008

G. Kim and . Larsen, Modal specifications Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science, vol.407, pp.232-246, 1989.

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, 2011.
DOI : 10.1016/j.tcs.2011.04.003
URL : https://hal.archives-ouvertes.fr/hal-01088055

F. and W. Lawvere, Metric spaces, generalized logic, and closed categories. Rendiconti del seminario matématico e fisico di, pp.135-166, 1973.
DOI : 10.1007/bf02924844

F. and W. Lawvere, Taking categories seriously, Revista Colombiana de Matemâticas, vol.XX, pp.147-178, 1986.

N. Lynch and M. R. Tuttle, An introduction to input/output automata, CWI- Quarterly, vol.2, issue.3, 1989.

R. Majumdar, Symbolic Algorithms for Verification and Control, 2003.

U. Nyman, Modal Transition Systems as the Basis for Interface Theories and Product Lines, 2008.

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

D. Sangiorgi, On the origins of bisimulation and coinduction, ACM Trans. Program. Lang. Syst, vol.31, issue.4, 2009.

J. Sifakis, A vision for computer science ??? the system perspective, Open Computer Science, vol.1, issue.1, pp.108-116, 2011.
DOI : 10.2478/s13537-011-0008-y

C. Thrane, Quantitative Models and Analysis For Reactive Systems, 2011.

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, 2010.
DOI : 10.1016/j.jlap.2010.07.010

. Franck-van-breugel, Topological Models in Comparative Semantics, 1994.

. Franck-van-breugel, A Theory of Metric Labelled Transition Systems, Annals of the New York Academy of Sciences, vol.5, issue.1, pp.69-87, 1996.
DOI : 10.2307/1990864

U. Zwick and M. Paterson, The complexity of mean payoff games, Lecture Notes in Computer Science, vol.959, pp.1-10, 1995.
DOI : 10.1007/BFb0030814