[. Akroun and G. Salaün, Automated verification of automata communicating via FIFO and bag buffers Formal Methods in System Design Automated analysis of asynchronously communicating systems, SPIN'16, pp.260-276, 2016.

S. Basu and T. Bultan, Choreography conformance via synchronizability, Proceedings of the 20th international conference on World wide web, WWW '11, pp.795-804, 2011.
DOI : 10.1145/1963405.1963516

S. Basu and T. Bultan, On deciding synchronizability for asynchronously communicating systems, Theoretical Computer Science, vol.656, pp.60-75, 2016.
DOI : 10.1016/j.tcs.2016.09.023

S. Basu, T. Bultan, and M. Ouederni, Deciding choreography realizability, Procs. of POPL'12, pp.191-202, 2012.

S. Basu, T. Bultan, and M. Ouederni, Synchronizability for Verification of Asynchronously Communicating Systems, Procs. of VMCAI 2012, 2012.
DOI : 10.1007/978-3-642-15646-5_16

A. Bouajjani, C. Enea, K. Ji, and S. Qadeer, On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony, CAV 2018, pp.372-391, 2018.
DOI : 10.1145/996841.996845
URL : https://hal.archives-ouvertes.fr/hal-01947855

B. Boigelot and P. Godefroid, Symbolic verification of communication protocols with infinite state spaces using qdds. Formal Methods in System Design, pp.237-255, 1999.

G. Cécé and A. Finkel, Verification of programs with half-duplex communication, CHS14] Lorenzo Clemente, Frédéric Herbreteau, and Grégoire Sutre Procs. of CONCUR 2014, pp.166-190, 2005.
DOI : 10.1016/j.ic.2005.05.006

P. Chambart and P. Schnoebelen, Mixing Lossy and Perfect Fifo Channels, Procs. of CONCUR 2008, pp.340-355, 2008.
DOI : 10.1007/978-3-540-85361-9_28

P. Deniélou and N. Yoshida, Multiparty Session Types Meet Communicating Automata, Procs. of ESOP 2012, pp.194-213, 2012.
DOI : 10.1007/978-3-642-28869-2_10

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, D. Kuske, and A. Muscholl, On communicating automata with bounded channels, Fundamenta Informaticae, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00306256

A. Heußner, T. L. Gall, and G. Sutre, McScM: A general framework for the verification of communicating machines, Procs. of TACAS 2012, pp.478-484, 2012.

A. Heußner, J. Leroux, A. Muscholl, and G. Sutre, Reachability analysis of communicating pushdown systems, Logical Methods in Computer Science, vol.8, issue.3, p.2012

S. La-torre, P. Madhusudan, and G. Parlato, Context-Bounded Analysis of Concurrent Queue Systems, Procs. of TACAS 2008, pp.299-314, 2008.
DOI : 10.1007/978-3-540-78800-3_21

R. Manohar and A. J. Martin, Slack elasticity in concurrent computing, Procs. of Math. of Prog. Construction (MPC'98), pp.272-285, 1998.
DOI : 10.1007/BFb0054295

J. Pachl, Protocol description and analysis based on a state transition model with channel expressions, Proc. of Protocol Specification, Testing, and Verification, VII, 1987.

F. Stephen and . Siegel, Efficient verification of halting properties for MPI programs with wildcard receives, Procs. of VMCAI 2005, pp.413-429, 2005.

S. Vakkalanka, A. Vo, G. Gopalakrishnan, and R. M. Kirby, Precise Dynamic Analysis for Slack Elasticity: Adding Buffering without Adding Bugs, Procs. of EuroMPI 2010, pp.152-159, 2010.
DOI : 10.1007/978-3-642-15646-5_16