. R. Bibliography, M. Alur, P. Arenas, K. Barceló, N. Etessami et al., First-order and temporal logics for nested words, Logical Methods in Computer Science, vol.4, issue.11, pp.1-44, 2008.

S. Akshay, B. Bollig, and P. Gastin, Event-clock message passing automata: A logical characterization and an emptiness checking algorithm . Formal Methods in System Design, pp.262-300, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00925745

B. S. Akshay, P. Bollig, M. Gastin, K. Mukund, . Narayan et al., Distributed Timed Automata with Independently Evolving Clocks, Fundamenta Informaticae, vol.130, issue.4, pp.377-407, 2014.
DOI : 10.1007/978-3-540-85361-9_10

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

M. F. Atig, B. Bollig, and P. Habermehl, Emptiness of multipushdown automata is 2ETIME-complete, DLT'08, pp.121-133, 2008.

M. F. Atig, A. Bouajjani, K. Narayan-kumar, and P. Saivasan, Linear-time model-checking for multithreaded programs under scopebounding, ATVA'12, pp.152-166

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.

R. Alur, S. Chaudhuri, and P. Madhusudan, Languages of Nested Trees, CAV'06, pp.329-342, 2006.
DOI : 10.1007/11817963_31

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

I. [. Akshay, B. Dinca, A. Genest, and . Stefanescu, Implementing realistic asynchronous automata, FSTTCS'13, volume 24 of Leibniz International Proceedings in Informatics Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.213-224, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00920776

K. [. Alur, P. Etessami, and . Madhusudan, A Temporal Logic of Nested Calls and Returns, TACAS'04, pp.467-481, 2004.
DOI : 10.1007/978-3-540-24730-2_35

K. [. Alur, M. Etessami, and . 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

C. Aiswarya and P. Gastin, Reasoning about distributed systems: WYSIWYG, FSTTCS'14, volume 29 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.11-30, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01091168

]. C. Agnk14a, P. Aiswarya, K. Gastin, . Narayan, and . Kumar, Controllers for the verification of communicating multi-pushdown systems, CON- CUR'14, pp.297-311, 2014.

]. C. Agnk14b, P. Aiswarya, K. Gastin, . Narayan, and . Kumar, Verifying communicating multi-pushdown systems via split-width, ATVA'14, pp.1-17, 2014.

F. [. Abdulla, L. Haziza, and . Holík, All for the Price of Few, VMCAI'13, pp.476-495, 2013.
DOI : 10.1007/978-3-642-35873-9_28

P. A. Abdulla and B. Jonsson, Verifying programs with unreliable channels, LICS'03, pp.160-170, 1993.

S. [. Aminof, A. Jacobs, S. Khalimov, and . Rubin, Parameterized Model Checking of Token-Passing Systems, VMCAI'14, pp.262-281, 2014.
DOI : 10.1007/978-3-642-54013-4_15

T. B. Aminof, S. Kotek, F. Rubin, H. Spegni, and . Veith, Parameterized Model Checking of Rendezvous Systems, CONCUR'14, pp.109-124, 2014.
DOI : 10.1007/978-3-662-44584-6_9

R. Alur and P. Madhusudan, Adding nesting structure to words, Journal of the ACM, vol.56, issue.3, pp.1-43, 2009.
DOI : 10.1145/1516512.1516518

R. Alur and P. Madhusudan, Adding nesting structure to words, Journal of the ACM, vol.56, issue.3, pp.1-43, 2009.
DOI : 10.1145/1516512.1516518

J. Armstrong, Programming Erlang: Software for a Concurrent World, 2007.

M. F. Atig, Global Model Checking of Ordered Multi-Pushdown Systems, FSTTCS'10 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.216-227, 2010.

L. Breveglieri, A. Cherubini, C. Citrini, and S. C. 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

A. [. Bollig, P. Cyriac, K. Gastin, . Narayan, and . Kumar, Model Checking Languages of Data Words, FoSSaCS'12, pp.391-405, 2012.
DOI : 10.1007/978-3-642-28729-9_26

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

A. [. Bollig, P. Cyriac, M. Gastin, and . Zeitoun, Temporal logics for concurrent recursive programs: Satisfiability and model checking, Journal of Applied Logic, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00591139

S. Balaguer, T. Chatain, and S. Haar, A concurrency-preserving translation from time petri nets to networks of timed automata. Formal Methods in System Design, pp.330-355, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00776605

. Bch-+-13-]-b, A. Bollig, L. Cyriac, A. Hélouët, T. Kara et al., Dynamic communicating automata and branching high-level MSCs, LATA'13, pp.177-189, 2013.

K. Bansal and S. Demri, Model-Checking Bounded Multi-Pushdown Systems, CSR'13, pp.405-417, 2013.
DOI : 10.1007/978-3-642-38536-0_35

. Bdm-+-11-]-m, C. Bojanczyk, A. David, T. Muscholl, L. Schwentick et al., Two-variable logic on data words, ACM Trans. Comput. Log, vol.12, issue.4, p.27, 2011.

J. [. Bouajjani, T. Esparza, and . Touili, A Generic Approach to the Static Analysis of Concurrent Programs with Procedures, International Journal of Foundations of Computer Science, vol.14, issue.04, pp.551-582, 2003.
DOI : 10.1142/S0129054103001893

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

M. [. Bollig, P. Grindei, and . Habermehl, Realizability of Concurrent Recursive Programs, FoSSaCS'09, pp.410-424, 2009.
DOI : 10.1007/11817963_29

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

B. Bollig, P. Gastin, and A. Kumar, Parameterized communicating automata: Complementation and model checking, FSTTCS'14, volume 29 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.625-637, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01030765

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

P. [. Bollig, J. Gastin, and . Schubert, Parameterized Verification of Communicating Automata under Context Bounds, LNCS, vol.14, issue.8762, pp.45-57, 2014.
DOI : 10.1007/978-3-319-11439-2_4

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

P. [. Bollig, M. Habermehl, B. Leucker, and . Monmege, A Robust Class of Data Languages and an Application to Learning, Logical Methods in Computer Science, vol.10, issue.4, 2014.
DOI : 10.2168/LMCS-10(4:19)2014

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

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

B. [. Bengtsson, J. Jonsson, W. Lilius, and . Yi, Partial order reductions for timed systems, CONCUR'98, pp.485-500, 1998.
DOI : 10.1007/BFb0055643

B. Bollig and D. Kuske, Muller message-passing automata and logics. Information and Computation, pp.1084-1094, 2008.

B. Bollig and D. Kuske, An optimal construction of Hanf sentences, Journal of Applied Logic, vol.10, issue.2, pp.179-186, 2012.
DOI : 10.1016/j.jal.2012.01.002

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

D. [. Bollig, I. Kuske, and . Meinecke, Propositional dynamic logic for message-passing systems, Logical Methods in Computer Science, vol.6, issue.3, p.16, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00779914

D. [. Bollig, R. Kuske, and . Mennicke, The complexity of model checking multi-stack systems, LICS'13, pp.163-170, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00926182

B. Bollig and M. Leucker, Message-passing automata are expressively equivalent to EMSO logic, Theoretical Computer Science, vol.358, issue.2-3, pp.150-172, 2006.
DOI : 10.1016/j.tcs.2006.01.014

M. Boja?czyk and S. Lasota, An extension of data automata that captures XPath, LICS'10, pp.243-252, 2010.
DOI : 10.2168/LMCS-8(1:5)2012

M. Boja?czyk, A. Muscholl, T. Schwentick, and L. Segoufin, Twovariable logic on data trees and applications to XML reasoning, Journal of the ACM, vol.56, issue.3, 2009.

M. Bojanczyk, Nominal monoids. Theory of Computing Systems, pp.194-222, 2013.

]. B. Bol08 and . Bollig, On the expressive power of 2-stack visibly pushdown automata, Logical Methods in Computer Science, vol.4, issue.4, p.16, 2008.

]. B. Bol11 and . Bollig, An automaton over data words that captures EMSO logic, CONCUR'11, pp.171-186, 2011.

B. Bollig, Logic for communicating automata with parameterized topology, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, 2014.
DOI : 10.1145/2603088.2603093

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

P. Bouyer, A. Petit, and D. Thérien, An algebraic approach to data languages and timed languages, Information and Computation, vol.182, issue.2, pp.137-162, 2003.
DOI : 10.1016/S0890-5401(03)00038-5

H. Björklund and T. Schwentick, On notions of regularity for data languages, Theoretical Computer Science, vol.411, issue.4-5, pp.702-715, 2010.
DOI : 10.1016/j.tcs.2009.10.009

L. Bozzelli and C. Sánchez, Visibly rational expressions, FSTTCS'12 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.211-223, 2012.
DOI : 10.1007/s00236-013-0190-6

L. Bozzelli and C. Sánchez, Visibly linear temporal logic, IJ- CAR'14, pp.418-433, 2014.

J. Büchi, Weak second order logic and finite automata, Z. Math. Logik, Grundlag. Math, vol.5, pp.66-62, 1960.

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

T. [. Cassez, C. Chatain, and . Jard, Symbolic Unfoldings for Networks of Timed Automata, ATVA'06, pp.307-321, 2006.
DOI : 10.1007/11901914_24

URL : https://hal.archives-ouvertes.fr/inria-00363033

J. Chalopin, S. Das, and A. Kosowski, Constructing a Map of an Anonymous Graph: Applications of Universal Sequences, OPODIS'10, pp.119-134, 2010.
DOI : 10.1007/3-540-61440-0_163

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

E. M. Clarke and E. A. Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic, Proceedings of the Workshop on Logics of Programs, pp.52-71, 1981.

P. [. Cyriac, K. Gastin, . Narayan, and . Kumar, MSO Decidability of Multi-Pushdown Systems via Split-Width, CONCUR'12, pp.547-561, 2012.
DOI : 10.1007/978-3-642-32940-1_38

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

F. S. Cassel, B. Howar, M. Jonsson, B. Merten, and . Steffen, A succinct canonical register automaton model, ATVA'11, pp.366-380, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00647724

T. Colcombet, C. Ley, and G. Puppis, On the Use of Guards for Logics with Data, MFCS'11, pp.243-255, 2011.
DOI : 10.1007/978-3-642-22993-0_24

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

]. A. Cyr10 and . Cyriac, Temporal logics for concurrent recursive programs, Master Parisien de Recherche en Informatique, 2010.

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

L. [. De-wulf, N. Doyen, J. Markey, and . Raskin, Robustness and Implementability of Timed Automata, FORMATS and FTRTFT, pp.118-133, 2004.
DOI : 10.1007/978-3-540-30206-3_10

P. [. Diekert and . Gastin, LTL Is Expressively Complete for Mazurkiewicz Traces, Journal of Computer and System Sciences, vol.64, issue.2, pp.396-418, 2002.
DOI : 10.1006/jcss.2001.1817

P. [. Diekert and . Gastin, Pure future local temporal logics are expressively complete for Mazurkiewicz traces, Information and Computation, vol.204, issue.11, pp.1597-1619, 2006.
DOI : 10.1016/j.ic.2006.07.002

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

P. [. Diekert, A. Gastin, and . Petit, Rational and Recognizable Complex Trace Languages, Information and Computation, vol.116, issue.1, pp.134-153, 1995.
DOI : 10.1006/inco.1995.1010

C. Dima and R. Lanotte, Distributed Time-Asynchronous Automata, ICTAC'07, pp.185-200, 2007.
DOI : 10.1007/978-3-540-75292-9_13

R. [. Demri and . Lazi?, LTL with the freeze quantifier and register automata, ACM Transactions on Computational Logic, vol.10, issue.3, 2009.

V. Diekert and A. Muscholl, Deterministic asynchronous automata for infinite traces, Acta Informatica, vol.21, issue.4, pp.379-397, 1994.
DOI : 10.1007/BF01178512

V. Diekert and G. Rozenberg, The Book of Traces, World Scientific, 1995.
DOI : 10.1142/2563

G. Delzanno, A. Sangnier, and R. Traverso, Parameterized Verification of Broadcast Networks of Register Automata, RP'13, pp.109-121, 2013.
DOI : 10.1007/978-3-642-41036-9_11

G. Delzanno, A. Sangnier, and G. Zavattaro, Parameterized Verification of Ad Hoc Networks, CONCUR'10, 2010.
DOI : 10.1007/978-3-642-15375-4_22

A. [. Delzanno, G. Sangnier, and . Zavattaro, On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks, FoSSaCS'11, pp.441-455, 2011.
DOI : 10.1007/978-3-642-19805-2_30

J. Esparza, P. Ganty, and R. Majumdar, Parameterized verification of asynchronous shared-memory systems, CAV'13, pp.124-140, 2013.

E. A. Emerson and V. Kahlon, Parameterized model checking of ringbased message passing systems, CSL'04, pp.325-339, 2004.

C. C. Elgot, Decision problems of finite automata design and related arithmetics. Transactions of the, pp.21-52, 1961.

E. A. Emerson and K. S. Namjoshi, On Reasoning About Rings, International Journal of Foundations of Computer Science, vol.14, issue.04, pp.527-550, 2003.
DOI : 10.1142/S0129054103001881

J. Esparza, Keeping a crowd safe: On the complexity of parameterized verification, STACS'14, volume 25 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.1-10, 2014.

D. Figueira, Reasoning on Words and Trees with Data, 2010.
URL : https://hal.archives-ouvertes.fr/tel-00718605

M. [. Francez and . Kaminski, An algebraic characterization of deterministic regular languages over infinite alphabets, Theoretical Computer Science, vol.306, issue.1-3, pp.155-175, 2003.
DOI : 10.1016/S0304-3975(03)00246-9

]. B. Gen05 and . Genest, On implementation of global concurrent systems with local asynchronous controllers, CONCUR'05, pp.443-457, 2005.

H. [. Genest, A. Gimbert, I. Muscholl, and . Walukiewicz, Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata, ICALP'10, pp.52-63, 2010.
DOI : 10.1007/978-3-642-14162-1_5

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

H. [. Genest, A. Gimbert, I. Muscholl, and . Walukiewicz, Asynchronous Games over Tree Architectures, ICALP'13, pp.275-286, 2013.
DOI : 10.1007/978-3-642-39212-2_26

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

P. Gastin and D. Kuske, Uniform satisfiability in PSPACE for local temporal logics over Mazurkiewicz traces, Fundamenta Informaticae, vol.80, issue.1-3, pp.169-197, 2007.

D. [. Gastin and . Kuske, Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces, Information and Computation, vol.208, issue.7, pp.797-816, 2010.
DOI : 10.1016/j.ic.2009.12.003

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

D. [. Genest, A. Kuske, and . 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, D. Kuske, and A. Muscholl, On communicating automata with bounded channels, Fundamenta Informaticae, vol.80, issue.1-3, pp.147-167, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00306256

O. Grinchtein and M. Leucker, Network invariants for real-time systems, Formal Aspects of Computing, vol.2, issue.4, pp.619-635, 2008.
DOI : 10.1007/s00165-008-0089-0

B. Genest and A. Muscholl, Constructing Exponential-Size Deterministic Zielonka Automata, ICALP'06, pp.565-576, 2006.
DOI : 10.1007/11787006_48

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

E. Gunter, A. Muscholl, and D. Peled, Compositional message sequence charts, International Journal on Software Tools for Technology Transfer, vol.21, issue.1, pp.78-89, 2003.
DOI : 10.1007/s10009-002-0085-2

A. [. Genest, H. Muscholl, M. Seidl, and . 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

P. Gastin and N. Sznajder, Fair Synthesis for Asynchronous Distributed Systems, ACM Transactions on Computational Logic, vol.14, issue.2, p.2013
DOI : 10.1145/2480759.2480761

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

Z. [. Grumbach and . Wu, Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract), WG'09, pp.154-165, 2010.
DOI : 10.1007/978-3-642-11409-0_14

]. W. Han65 and . Hanf, Model-theoretic methods in the study of elementary logic The Theory of Models, 1965.

. G. Hjj-+-95-]-j, J. L. Henriksen, M. E. Jensen, N. Jørgensen, R. Klarlund et al., Mona: Monadic second-order logic in practice, TACAS'95, pp.89-110

J. [. Heußner, A. Leroux, G. Muscholl, and . Sutre, Reachability analysis of communicating pushdown systems, Logical Methods in Computer Science, vol.8, issue.323, pp.1-20, 2012.

. G. Hmk-+-05-]-j, M. Henriksen, K. Mukund, M. Narayan-kumar, P. S. Sohoni et al., A theory of regular MSC languages, Information and Computation, vol.202, issue.1, pp.1-38, 2005.

G. Holzmann, The model checker SPIN, IEEE Transactions on Software Engineering, vol.23, issue.5, 2003.
DOI : 10.1109/32.588521

S. Jacobs and R. Bloem, Parameterized synthesis, Logical Methods in Computer Science, vol.10, issue.1, p.2014

H. Kamp, Tense Logic and the Theory of Linear Order, 1968.

M. Kaminski and N. Francez, Finite-memory automata, Theoretical Computer Science, vol.134, issue.2, pp.329-363, 1994.
DOI : 10.1016/0304-3975(94)90242-9

A. Kara, T. Schwentick, and T. Tan, Feasible automata for twovariable logic with successor on data words, LATA'12, pp.351-362, 2012.

]. D. Kus03 and . Kuske, Regular sets of infinite message sequence charts, Information and Computation, vol.187, pp.80-109, 2003.

M. Kaminski and D. Zeitlin, FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT, International Journal of Foundations of Computer Science, vol.21, issue.05, pp.741-760, 2010.
DOI : 10.1142/S0129054110007532

]. L. Lib04 and . Libkin, Elements of Finite Model Theory, 2004.

M. Lohrey and A. Muscholl, Bounded MSC communication, Information and Computation, vol.189, issue.2, pp.160-181, 2004.
DOI : 10.1016/j.ic.2003.10.002

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

M. Leucker, P. Madhusudan, and S. Mukhopadhyay, Dynamic Message Sequence Charts, FSTTCS 2002, pp.253-264, 2002.
DOI : 10.1007/3-540-36206-1_23

[. Torre, P. Madhusudan, and G. Parlato, A Robust Class of Context-Sensitive Languages, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.161-170, 2007.
DOI : 10.1109/LICS.2007.9

]. S. Lmp08a, P. La-torre, G. Madhusudan, and . Parlato, Context-bounded analysis of concurrent queue systems, Proceedings of TACAS'08, pp.299-314, 2008.

]. S. Lmp08b, P. La-torre, G. Madhusudan, and . Parlato, An infinite automaton characterization of double exponential time, CSL'08, pp.33-48, 2008.

]. S. Lmp10a, P. La-torre, G. Madhusudan, and . Parlato, The language theory of bounded context-switching, LATIN'08, pp.96-107, 2010.

]. S. Lmp10b, P. La-torre, G. Madhusudan, and . Parlato, Model-checking parameterized concurrent programs using linear interfaces, CAV'10, pp.629-644, 2010.

[. Torre and M. Napoli, Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations, CONCUR'11, pp.203-218, 2011.
DOI : 10.1007/978-3-540-85114-1_19

]. S. Lnp14a, M. Torre, G. Napoli, and . Parlato, Scope-bounded pushdown languages, DLT'14, pp.116-128

]. S. Lnp14b, M. Torre, G. Napoli, and . Parlato, A unifying approach for multistack pushdown automata, MFCS'14, pp.377-389, 2014.

P. [. Lugiez, S. Niebert, and . 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

[. Torre and G. Parlato, Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width, FSTTCS'12 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.173-184, 2012.

P. [. Larsen, W. Pettersson, and . Yi, Compositional and symbolic model-checking of real-time systems, RTSS'95, pp.76-89, 1995.

C. Lautemann, T. Schwentick, and D. Thérien, Logics for context-free languages, CSL'94, pp.205-216, 1995.
DOI : 10.1007/BFb0022257

T. [. Lal, N. Touili, T. W. Kidd, and . Reps, Interprocedural Analysis of Concurrent Programs Under a Context Bound, TACAS'08, pp.282-298, 2008.
DOI : 10.1007/978-3-540-78800-3_20

[. Torre and M. Napoli, A Temporal Logic for Multi-threaded Programs, IFIP-TCS'12, pp.225-239
DOI : 10.1007/978-3-642-33475-7_16

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

]. P. Mad01 and . Madhusudan, Reasoning about sequential and branching behaviours of message sequence graphs, ICALP'01, pp.809-820, 2001.

]. P. Mad03 and . Madhusudan, Model-checking trace event structures, LICS'03, pp.371-380, 2003.

R. Mennicke, Model Checking Concurrent Recursive Programs Using Temporal Logics, MFCS'14, pp.438-450
DOI : 10.1007/978-3-662-44522-8_37

]. R. Mey08 and . Meyer, On boundedness in depth in the ?-calculus, IFIP TCS'08, pp.477-489, 2008.

P. Madhusudan and B. Meenakshi, Beyond Message Sequence Graphs, FSTTCS 2001, pp.256-267, 2001.
DOI : 10.1007/3-540-45294-X_22

A. Manuel, A. Muscholl, and G. Puppis, Walking on data words, CSR'13, pp.64-75, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00877065

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

O. Matz, N. Schweikardt, and W. Thomas, The Monadic Quantifier Alternation Hierarchy over Grids and Graphs, Information and Computation, vol.179, issue.2, pp.356-383, 2002.
DOI : 10.1006/inco.2002.2955

P. Madhusudan, P. S. Thiagarajan, and S. Yang, The MSO Theory of Connectedly Communicating Processes, FSTTCS'05, pp.201-212, 2005.
DOI : 10.1007/11590156_16

]. A. Mus94 and . Muscholl, Über die Erkennbarkeit unendlicher Spuren, 1994.

A. Muscholl and I. Walukiewicz, Distributed Synthesis for Acyclic Architectures, FSTTCS'14 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.639-651, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00946554

F. Neven, T. Schwentick, and V. Vianu, Finite state machines for strings over infinite alphabets, ACM Transactions on Computational Logic, vol.5, issue.3, pp.403-435, 2004.
DOI : 10.1145/1013560.1013562

E. Ochma?ski, Recognizable Trace Languages, Diekert and Rozenberg [DR95], chapter 6, pp.167-204
DOI : 10.1142/9789814261456_0006

]. W. Pen97 and . Penczek, Model-checking for a subclass of event structures, TACAS'97, pp.145-164, 1997.

G. Peterson and J. Reif, Multiple-person alternation, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pp.348-363, 1979.
DOI : 10.1109/SFCS.1979.25

G. Peterson, J. Reif, and S. Azhar, Lower bounds for multiplayer noncooperative games of incomplete information, Computers & Mathematics with Applications, vol.41, issue.7-8, pp.957-992, 2001.
DOI : 10.1016/S0898-1221(00)00333-3

A. Puri, Dynamical properties of timed automata. Discrete Event Dynamic Systems, pp.87-113, 2000.

. [. Peled, . Th, P. Wilke, and . Wolper, An algorithmic approach for checking closure properties of temporal logic specifications and ??-regular languages, Theoretical Computer Science, vol.195, issue.2, pp.183-203, 1998.
DOI : 10.1016/S0304-3975(97)00219-3

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

J. P. Queille and J. Sifakis, Specification and verification of concurrent systems in CESAR, International Symposium on Programming, pp.337-351, 1982.
DOI : 10.1007/3-540-11494-7_22

]. G. Ram00 and . Ramalingam, Context-sensitive synchronization-sensitive analysis is undecidable, ACM Transactions on Programming Languages and Systems, vol.22, issue.2, pp.416-430, 2000.

T. Schwentick and K. Barthelmann, Local normal forms for first-order logic with applications to games and automata, Discrete Mathematics & Theoretical Computer Science, vol.3, issue.3, pp.109-124, 1999.
DOI : 10.1007/BFb0028580

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

]. L. Seg06 and . Segoufin, Automata and logics for words and trees over an infinite alphabet, CSL'06, pp.41-57, 2006.

J. [. Stefanescu, A. Esparza, and . Muscholl, Synthesis of distributed algorithms using asynchronous automata, CONCUR'03, pp.27-41, 2003.

S. Schewe and B. Finkbeiner, SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS, International Journal of Foundations of Computer Science, vol.18, issue.01, pp.113-138, 2007.
DOI : 10.1142/S0129054107004590

M. Swaminathan, M. Fränzle, and J. Katoen, The Surprising Robustness of (Closed) Timed Automata against Clock-Drift, IFIP- TCS'08, pp.537-553, 2008.
DOI : 10.1007/978-0-387-09680-3_36

]. W. Tho90 and . Thomas, On logical definability of trace languages, Proceedings of Algebraic and Syntactic Methods in Computer Science (ASMICS), pp.172-182, 1990.

]. W. Tho96 and . Thomas, Elements of an automata theory over partial orders, POMIV'96, 1996.

]. W. Tho97 and . Thomas, Languages, automata and logic, Handbook of Formal Languages, pp.389-455, 1997.

]. B. Tra62 and . Trakhtenbrot, Finite automata and monadic second order logic. Siberian Math In Russian; English translation in Amer, J Math. Soc. Transl, vol.3, issue.59, pp.103-131, 1962.

I. [. Thiagarajan and . Walukiewicz, An expressively complete linear time temporal logic for Mazurkiewicz traces, LICS'97, pp.183-194, 1997.

]. N. Tze11 and . Tzevelekos, Fresh-register automata, POPL'11, pp.295-306, 2011.

G. Winskel and M. Nielsen, Models for concurrency, In Handbook of Logic in Computer Science, vol.4, pp.1-148, 1995.

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