S. Akshay, B. Genest, L. Hélouët, and S. Yang, Regular set of representatives for time-constrained MSC graphs, Proc. Letters, pp.14-15592, 2012.
DOI : 10.1016/j.ipl.2012.05.002
URL : https://hal.archives-ouvertes.fr/hal-00879825

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 scenario-based specifications, FSTTCS 2010, pp.290-302

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

J. Bengtsson and W. Yi, On Clock Difference Constraints and Termination in Reachability Analysis of Timed Automata, ICFEM 2003, pp.491-503
DOI : 10.1007/978-3-540-39893-6_28

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

G. Dantzig and B. C. Eaves, Fourier-Motzkin elimination and its dual, Journal of Combinatorial Theory, Series A, vol.14, issue.3, pp.288-297, 1973.
DOI : 10.1016/0097-3165(73)90004-6
URL : http://doi.org/10.1016/0097-3165(73)90004-6

C. Dima and R. Lanotte, Distributed Time-Asynchronous Automata, ICTAC 2007, pp.185-200
DOI : 10.1007/978-3-540-75292-9_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.278.6585

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

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

B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms, 2006.

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

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

R. Shostak, Deciding Linear Inequalities by Computing Loop Residues, Journal of the ACM, vol.28, issue.4, pp.769-779, 1981.
DOI : 10.1145/322276.322288
URL : http://www.dtic.mil/get-tr-doc/pdf?AD=ADA055868

J. Zhao, H. Xu, X. Li, T. Zheng, and G. Zheng, Partial Order Path Technique for Checking Parallel Timed Automata, FTRTFT 2002, pp.417-432
DOI : 10.1007/3-540-45739-9_24