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

S. Akshay, P. Gastin, K. Narayan-kumar, and M. Mukund, Model checking time-constrained scenariobased specifications, FSTTCS 2010, pp.290-302
DOI : 10.1016/j.tcs.2015.03.030

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

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

C. Baier, T. Brihaye, N. Bertrand, and P. Bouyer, When Are Timed Automata Determinizable?, LNCS, vol.5556, issue.2, pp.43-54, 2009.
DOI : 10.1007/978-3-642-02930-1_4
URL : https://hal.archives-ouvertes.fr/inria-00424351

P. Bouyer, S. Haddad, and P. Reynier, Timed Unfoldings for Networks of Timed Automata, ATVA 2006, pp.292-306
DOI : 10.1007/11901914_23

F. Cassez, T. Chatain, and C. Jard, Symbolic Unfoldings for Networks of Timed Automata, ATVA 2006, pp.307-321
DOI : 10.1007/11901914_24
URL : https://hal.archives-ouvertes.fr/inria-00363033

C. Dima and R. Lanotte, Distributed timeasynchronous automata, ICTAC 2007, pp.185-200

P. Gastin, K. Narayan-kumar, and M. Mukund, Reachability and boundedness in time-constrained MSC graphs, Perspectives in Concurrency ? A Feststichrift for P. S, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00772665

B. Genest, D. Kuske, and A. Muscholl, A Kleene theorem and model checking algorithms for existentially bounded communicating automata, Information and Computation, vol.204, issue.6, pp.920-956, 2006.
DOI : 10.1016/j.ic.2006.01.005
URL : https://hal.archives-ouvertes.fr/hal-00306261

J. G. Henriksen, M. Mukund, K. N. Kumar, M. Sohoni, and P. S. Thiagarajan, A theory of regular MSC languages, Information and Computation, vol.202, issue.1, pp.1-38, 2005.
DOI : 10.1016/j.ic.2004.08.004

D. Lugiez, P. Niebert, and S. Zennou, A partial order semantics approach to the clock explosion problem of timed automata, Theoretical Computer Science, vol.345, issue.1, pp.27-59, 2005.
DOI : 10.1016/j.tcs.2005.07.023

P. Madhusudan and B. Meenakshi, Beyond Message Sequence Graphs, FSTTCS 2001, pp.256-267
DOI : 10.1007/3-540-45294-X_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3902

A. Muscholl and D. Peled, Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces, MFCS 1999, pp.81-91
DOI : 10.1007/3-540-48340-3_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.7078

S. Akshay, B. Genest, L. Hélouët, and S. Yang, Symbolically bounding the drift in timeconstrained MSC graphs
URL : https://hal.archives-ouvertes.fr/hal-00879831

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, 2011.
DOI : 10.1016/j.ipl.2012.05.002
URL : https://hal.archives-ouvertes.fr/hal-00879825