L. Akroun and G. Salaün, Automated verification of automata communicating via FIFO and bag buffers, Formal Methods in System Design, vol.52, issue.3, pp.260-276, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01898159

S. Basu and T. Bultan, On deciding synchronizability for asynchronously communicating systems, Theor. Comput. Sci, vol.656, pp.60-75, 2016.


S. Basu, T. Bultan, and M. Ouederni, Verification, Model Checking, and Abstract Interpretation -13th International Conference, Lecture Notes in Computer Science, vol.7148, pp.56-71, 2012.

A. Bouajjani, C. Enea, K. Ji, and S. Qadeer, On the completeness of verifying message passing programs under bounded asynchrony, Computer Aided Verification -30th International Conference, CAV 2018, Held as Part of the Federated Logic Conference, FloC, vol.10982, pp.372-391, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01947855

A. Bouajjani, P. Habermehl, and T. Vojnar, Abstract regular model checking, Computer Aided Verification, 16th International Conference, vol.3114, pp.372-386, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00159512

M. Chaouch-saad, B. Charron-bost, and S. Merz, A reduction theorem for the verification of round-based distributed algorithms
URL : https://hal.archives-ouvertes.fr/inria-00408908

, Reachability Problems, 3rd International Workshop, vol.5797, pp.93-106, 2009.

C. Chou and E. Gafni, Understanding and verifying distributed algorithms using stratified decomposition, Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, pp.44-65, 1988.

T. Elrad and N. Francez, Decomposition of distributed programs into communication-closed layers, Sci. Comput. Program, vol.2, issue.3, pp.155-173, 1982.

A. Finkel, É. Lozes, I. Chatzigiannakis, P. Indyk, and F. Kuhn, Synchronizability of communicating finite state machines is not decidable, 44th International Colloquium on Automata, Languages, and Programming, vol.80, pp.1-122, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01920609

B. Genest, D. Kuske, and A. Muscholl, On communicating automata with bounded channels, Fundam. Inform, vol.80, issue.1-3, pp.147-167, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00306256

K. Von-gleissenthall, R. G. Kici, A. Bakst, D. Stefan, and R. Jhala, Pretend synchrony: synchronous verification of asynchronous distributed programs, PACMPL 3(POPL), vol.59, p.30, 2019.

B. Kragl, S. Qadeer, and T. A. Henzinger, Synchronizing the asynchronous, 29th International Conference on Concurrency Theory, CONCUR 2018, vol.118, 2018.

L. Torre, S. Madhusudan, P. Parlato, and G. , Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, vol.4963, pp.299-314, 2008.

R. J. Lipton, Reduction: A method of proving properties of parallel programs, Commun. ACM, vol.18, issue.12, pp.717-721, 1975.

A. Muscholl, Analysis of communicating automata, Language and Automata Theory and Applications, 4th International Conference, vol.6031, pp.50-57, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00645460