S. Akshay, P. Gastin, M. Mukund, K. Narayan, and . Kumar, Model checking time-constrained scenario-based specifications, Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010 of LIPIcs Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.204-215, 2010.
DOI : 10.1016/j.tcs.2015.03.030

S. Akshay, B. Genest, L. Hélouët, and S. Yang, Regular set of representatives for time-constrained MSC graphs, Information Processing Letters, vol.112, issue.14-15, pp.14-15592, 2012.
DOI : 10.1016/j.ipl.2012.05.002

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

S. Akshay, B. Genest, L. Hélouët, and S. Yang, Symbolically Bounding the Drift in Time-Constrained MSC Graphs, Theoretical Aspects of Computing -ICTAC 2012, pp.1-15, 2012.
DOI : 10.1007/978-3-642-32943-2_1

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

S. Akshay, L. Hélouët, C. Jard, and P. Reynier, Robustness of time petri nets under guard enlargement, Proc. of RP 2012, pp.92-106, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01379431

S. Akshay, M. Mukund, K. Narayan, and . Kumar, Checking Coverage for Infinite Collections of Timed Scenarios, CONCUR 2007 -Concurrency Theory, pp.181-196, 2007.
DOI : 10.1007/978-3-540-74407-8_13

R. Alur and M. Yannakakis, Model Checking of Message Sequence Charts, Proc. of CONCUR'99, number 1664 in LNCS, pp.114-129, 1999.
DOI : 10.1007/3-540-48320-9_10

R. Alur, Timed Automata, Computer Aided Verification, pp.8-22, 1999.
DOI : 10.1007/3-540-48683-6_3

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

P. Bouyer, N. Markey, and P. Reynier, Robust Model-Checking of Linear-Time Properties in Timed Automata, Proc. of LATIN'06, pp.238-249, 2006.
DOI : 10.1007/11682462_25

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

P. Bouyer, N. Markey, and P. Reynier, Robust Analysis of Timed Automata Via Channel Machines, Proc. of FoSSaCS'08, pp.157-171, 2008.
DOI : 10.1007/978-3-540-78499-9_12

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

P. Bouyer, N. Markey, and O. Sankur, Robust Model-Checking of Timed Automata via Pumping in Channel Machines, Proceedings of the 9th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'11), pp.97-112, 2011.
DOI : 10.1007/s100090050009

P. Bouyer, N. Markey, and O. Sankur, Robustness in Timed Automata, Proceedings of the 7th Workshop on Reachability Problems in Computational Models (RP'13), pp.1-18, 2013.
DOI : 10.1007/978-3-642-41036-9_1

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.8409

L. Martin-de-wulf, N. Doyen, J. Markey, and . Raskin, Robust safety of timed automata. Formal Methods in System Design, pp.45-84, 2008.

L. Martin-de-wulf, J. Doyen, and . Raskin, Systematic implementation of real-time models, Formal Methods (FM'05), pp.139-156, 2005.

P. Gastin, M. Mukund, K. Narayan, and . Kumar, Reachability and boundedness in time-constrained MSC graphs, Perspectives in Concurrency Theory, pp.157-183, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00772665

A. Muscholl and D. Peled, Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces, MFCS, pp.81-91, 1999.
DOI : 10.1007/3-540-48340-3_8

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.7078

A. Puri, Dynamical properties of timed automata, DEDS, pp.87-113, 2000.
DOI : 10.1007/BFb0055349

O. Sankur, Untimed Language Preservation in Timed Systems, Proc. of MFCS'11, 2011.
DOI : 10.1007/978-3-642-22993-0_50

A. Schrijver, Theory of Linear and Integer Programming, 1998.

M. Swaminathan and M. 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 J. Katoen, The Surprising Robustness of (Closed) Timed Automata against Clock-Drift, TCS, pp.537-553, 2008.
DOI : 10.1007/978-0-387-09680-3_36