R. Alur and &. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-2350304, 1994.
DOI : 10.1016/0304-3975(94)90010-8

S. Sebastian, A. Bauer, R. David, K. G. Hennicker, A. Larsen et al., Moving from Specifications to Contracts in Component-Based Design, Lecture Notes in Computer Science, vol.7212, pp.43-58978, 2012.

S. Sebastian, U. Bauer, L. Fahrenberg, K. G. Juhl, A. Larsen et al., Quantitative Refinement for Weighted Modal Transition Systems, MFCS, pp.60-71978, 2011.

S. Sebastian, U. Bauer, A. Fahrenberg, C. Legay, and . Thrane, General Quantitative Specification Theories with Modalities, Lecture Notes in Computer Science, vol.7353, 2012.

S. Sebastian, L. Bauer, K. G. Juhl, A. Larsen, &. Legay et al., Extending Modal Transition Systems with Structured Labels, Mathematical Structures in Computer Science, 2012.

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

N. Bertrand, A. Legay, S. Pinchinat, &. Jean-baptiste, and . Raclet, A Compositional Approach on Modal Specifications for Timed Systems, Lecture Notes in Computer Science, vol.5885, pp.679-697978, 2009.
DOI : 10.1007/978-3-642-10373-5_35
URL : https://hal.archives-ouvertes.fr/inria-00418855

P. Bouyer, K. G. Larsen, N. Markey, O. Sankur, &. Claus et al., Timed Automata Can Always Be Made Implementable, Lecture Notes in Computer Science, vol.79, issue.7, pp.76-91, 2011.
DOI : 10.1016/j.jlap.2010.07.010

. 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. Fahrenberg, K. G. Larsen, and C. Thrane, A Quantitative Characterization of Weighted Kripke Structures in Temporal Logic, Comp. Inf, vol.29, pp.1311-1324, 2010.

U. Fahrenberg, A. Legay, and C. Thrane, The quantitative linear-time???branching-time spectrum, FSTTCS, LIPIcs 13, Schloss Dagstuhl -Leibniz- Zentrum fuer Informatik, pp.103-114, 2011.
DOI : 10.1016/j.tcs.2013.07.030
URL : https://hal.archives-ouvertes.fr/hal-01087368

U. Fahrenberg, A. Legay, and A. Wasowski, Vision Paper: Make a Difference! (Semantically), MoDELS, pp.490-500978, 2011.
DOI : 10.1007/978-3-540-88643-3_15
URL : https://hal.archives-ouvertes.fr/hal-01088049

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

P. Godefroid, M. Huth, and &. Jagadeesan, Abstraction-Based Model Checking Using Modal Transition Systems, Lecture Notes in Computer Science, vol.2154, pp.426-440, 2001.
DOI : 10.1007/3-540-44685-0_29

A. Gruler, M. Leucker, &. Kathrin, and D. Scheidemann, Modeling and Model Checking Software Product Lines, Lecture Notes in Computer Science, vol.5051, pp.113-131, 2008.
DOI : 10.1007/978-3-540-68863-1_8

V. Gupta and T. A. Henzinger-&-radha-jagadeesan, Robust timed automata, Lecture Notes in Computer Science, vol.1201, pp.331-345, 1997.
DOI : 10.1007/BFb0014736

T. A. Henzinger, R. Majumdar, &. Vinayak, and S. Prabhu, Quantifying Similarities Between Timed Systems, Lecture Notes in Computer Science, vol.3829, pp.226-241, 2005.
DOI : 10.1007/11603009_18

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, &. Claus, and R. 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

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

M. Sassolas, M. Chechik-&-sebastián, and . Uchitel, Exploring inconsistencies between modal transition systems, Software & Systems Modeling, vol.35, issue.3, pp.117-142, 2011.
DOI : 10.1007/s10270-010-0148-x
URL : https://hal.archives-ouvertes.fr/hal-01161870

M. Swaminathan and &. Martin-fränzle, A Symbolic Decision Procedure for Robust Safety of Timed Systems, 14th International Symposium on Temporal Representation and Reasoning (TIME'07), p.192, 2007.
DOI : 10.1109/TIME.2007.39

M. Swaminathan, M. Fränzle, and &. Katoen, The Surprising Robustness of (Closed) Timed Automata against Clock-Drift, IFIP TCS, pp.537-553, 2008.
DOI : 10.1007/978-0-387-09680-3_36

C. Thrane, U. Fahrenberg, &. Kim, and 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