R. Alur, K. Etessami, and M. Yannakakis, Realizability and verification of MSC graphs, Theoretical Computer Science, vol.331, issue.1, pp.97-114, 2005.
DOI : 10.1016/j.tcs.2004.09.034

M. F. Atig, A. Bouajjani, and S. Qadeer, Context-bounded analysis for concurrent programs with dynamic creation of threads, Logical Methods in Computer Science, vol.7, issue.4, 2011.

B. Bollig, A. Cyriac, L. Hélouët, A. Kara, and T. Schwentick, Dynamic Communicating Automata and Branching High-Level MSCs, 2012.
DOI : 10.1007/978-3-642-37064-9_17
URL : https://hal.archives-ouvertes.fr/hal-00879353

B. Bollig and L. Hélouët, Realizability of Dynamic MSC Languages, Proceedings of CSR'10, pp.48-59, 2010.
DOI : 10.1007/978-3-642-13182-0_5
URL : https://hal.archives-ouvertes.fr/inria-00589714

J. Borgström, A. Gordon, and A. Phillips, A Chart Semantics for the Pi-Calculus, Electronic Notes in Theoretical Computer Science, vol.194, issue.2, pp.3-29, 2008.
DOI : 10.1016/j.entcs.2007.11.002

L. Bozzelli, L. Torre, S. Peron, and A. , Verification of well-formed communicating recursive state machines, Theoretical Computer Science, vol.403, issue.2-3, pp.382-405, 2008.
DOI : 10.1016/j.tcs.2008.06.012

D. Brand and P. Zafiropulo, On Communicating Finite-State Machines, Journal of the ACM, vol.30, issue.2, 1983.
DOI : 10.1145/322374.322380

M. Buscemi and V. Sassone, High-Level Petri Nets as Type Theories in the Join Calculus, Proceedings of FOSSACS'01, pp.104-120, 2001.
DOI : 10.1007/3-540-45315-6_7

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

B. Genest, A. Muscholl, H. Seidl, and M. Zeitoun, Infinite-state high-level MSCs: Model-checking and realizability, Journal of Computer and System Sciences, vol.72, issue.4, pp.617-647, 2006.
DOI : 10.1016/j.jcss.2005.09.007
URL : https://hal.archives-ouvertes.fr/hal-00306255

L. Hélouët and C. Jard, Conditions for synthesis of communicating automata from HMSCs, Proceedings of FMICS'00, pp.203-224, 2000.

J. G. Henriksen, M. Mukund, K. Narayan-kumar, M. A. 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

M. Leucker, P. Madhusudan, and S. Mukhopadhyay, Dynamic Message Sequence Charts, Proceedings of FSTTCS'02, pp.253-264, 2002.
DOI : 10.1007/3-540-36206-1_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.1898

K. Lodaya and P. Weil, Series???parallel languages and the bounded-width property, Theoretical Computer Science, vol.237, issue.1-2, pp.347-380, 2000.
DOI : 10.1016/S0304-3975(00)00031-1

K. Lodaya and P. Weil, Rationality in Algebras with a Series Operation, Information and Computation, vol.171, issue.2, pp.269-293, 2001.
DOI : 10.1006/inco.2001.3077

M. Lohrey, Realizability of high-level message sequence charts: closing the gaps, Theoretical Computer Science, vol.309, issue.1-3, pp.529-554, 2003.
DOI : 10.1016/j.tcs.2003.08.002

R. Meyer, On Boundedness in Depth in the ??-Calculus, Proceedings of IFIP TCS'08. IFIP, pp.477-489, 2008.
DOI : 10.1007/978-0-387-09680-3_32

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, I. Information and Computation, pp.1-40, 1992.

R. Morin, Recognizable Sets of Message Sequence Charts, Proceedings of STACS 2002, pp.523-534, 2002.
DOI : 10.1007/3-540-45841-7_43

L. Segoufin, Automata and Logics for Words and Trees over an Infinite Alphabet, CSL 2006, pp.41-57, 2006.
DOI : 10.1007/11874683_3