R. Alur and P. Madhusudan, Adding nesting structure to words, Journal of the ACM, vol.5616, pp.1-1643, 2009.

M. F. Atig, B. Bollig, and P. Habermehl, Emptiness of Multi-pushdown Automata Is 2ETIME-Complete, DLT, pp.121-133, 2008.
DOI : 10.1007/978-3-540-85780-8_9

L. Breveglieri, A. Cherubini, C. Citrini, and S. Crespi-reghizzi, MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS, International Journal of Foundations of Computer Science, vol.07, issue.03, pp.253-292, 1996.
DOI : 10.1142/S0129054196000191

B. Courcelle, THE EXPRESSION OF GRAPH PROPERTIES AND GRAPH TRANSFORMATIONS IN MONADIC SECOND-ORDER LOGIC, Handbook of Graph Grammars, pp.313-400, 1997.
DOI : 10.1142/9789812384720_0005

A. Cyriac and . Cachan, Verification of Communicating Recursive Programs via Split-width, 2014.
URL : https://hal.archives-ouvertes.fr/tel-01015561

A. Cyriac, P. Gastin, K. Narayan, and . Kumar, MSO Decidability of Multi-Pushdown Systems via Split-Width, In CONCUR LNCS, vol.7454, pp.547-561, 2012.
DOI : 10.1007/978-3-642-32940-1_38
URL : https://hal.archives-ouvertes.fr/hal-00776596

A. Cyriac, P. Gastin, K. Narayan, and . Kumar, Verifying Communicating Multipushdown Systems, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00943690

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

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

A. Heußner, J. Leroux, A. Muscholl, and G. Sutre, Reachability analysis of communicating pushdown systems, FOSSACS, pp.267-281, 2010.

S. , L. Torre, P. Madhusudan, and G. Parlato, A robust class of context-sensitive languages, LICS, pp.161-170, 2007.

S. , L. Torre, P. Madhusudan, and G. Parlato, Context-bounded analysis of concurrent queue systems, TACAS, pp.299-314, 2008.

S. , L. Torre, P. Madhusudan, and G. Parlato, An infinite automaton characterization of double exponential time, CSL, pp.33-48, 2008.

S. , L. Torre, and M. Napoli, Reachability of multistack pushdown systems with scope-bounded matching relations, In CONCUR LNCS, vol.6901, pp.203-218, 2011.

P. Madhusudan and G. Parlato, The tree width of auxiliary storage, POPL, pp.283-294, 2011.

S. Qadeer and J. Rehof, Context-Bounded Model Checking of Concurrent Software, TACAS, pp.93-107, 2005.
DOI : 10.1007/978-3-540-31980-1_7

W. Zielonka, Notes on finite asynchronous automata, RAIRO - Theoretical Informatics and Applications, vol.21, issue.2, pp.99-135, 1987.
DOI : 10.1051/ita/1987210200991