R. M. Amadio, I. Castellani, and D. Sangiorgi, On bisimulations for the asynchronous ??-calculus, An extended abstract appeared in Proceedings of CONCUR '96, pp.291-324, 1998.
DOI : 10.1016/S0304-3975(97)00223-5
URL : https://hal.archives-ouvertes.fr/inria-00073784

J. Bergstra and J. Klop, Process algebra for synchronous communication, Information and Control, vol.60, issue.1-3, pp.109-137, 1984.
DOI : 10.1016/S0019-9958(84)80025-X

J. A. Bergstra, J. W. Klop, and J. V. Tucker, Process algebra with asynchronous communication mechanisms, Proceedings of the Seminar on Concurrency, pp.76-95, 1984.
DOI : 10.1007/3-540-15670-4_4

M. Boreale, R. D. Nicola, and R. Pugliese, Trace and Testing Equivalence on Asynchronous Processes, Information and Computation, vol.172, issue.2, pp.139-164, 2002.
DOI : 10.1006/inco.2001.3080

G. Boudol, Asynchrony and the ?-calculus (note), 1992.

S. Brookes, C. Hoare, and A. Roscoe, A Theory of Communicating Sequential Processes, Journal of the ACM, vol.31, issue.3, pp.560-599, 1984.
DOI : 10.1145/828.833

N. Busi, R. Gorrieri, and G. Zavattaro, Comparing three semantics for Linda-like languages, Theoretical Computer Science, vol.240, issue.1, pp.49-90, 2000.
DOI : 10.1016/S0304-3975(99)00227-3

L. Cardelli and A. D. Gordon, Mobile ambients, Theoretical Computer Science, vol.240, issue.1, pp.177-213, 2000.
DOI : 10.1016/S0304-3975(99)00231-5
URL : http://doi.org/10.1016/s1571-0661(05)80699-1

F. S. De-boer, J. W. Klop, and C. Palamidessi, Asynchronous communication in process algebra, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp.137-147, 1992.
DOI : 10.1109/LICS.1992.185528

D. Gorla, On the Relative Expressive Power of Asynchronous Communication Primitives, Proc. of 9th Intern. Conf. on Foundations of Software Science and Computation Structures (FoSSaCS'06), pp.47-62, 2006.
DOI : 10.1007/11690634_4

D. Gorla, On the criteria for a 'good' encoding: a new approach to encodability and separation results, 2007.

J. He, M. B. Josephs, and C. A. Hoare, A theory of synchrony and asynchrony, Programming Concepts and Methods, Proc. of the IFIP WG 2.2/2.3, Working Conf. on Programming Concepts and Methods, pp.459-478, 1990.

C. A. Hoare, Communicating Sequential Processes, 1985.

K. Honda and M. Tokoro, An object calculus for asynchronous communication, Proceedings of the European Conference on Object-Oriented Programming, pp.133-147, 1991.
DOI : 10.1007/BFb0057019

N. Lynch, Distributed Algorithms, 1996.

R. Milner, A Calculus of Communicating Systems, LNCS, vol.92, 1980.
DOI : 10.1007/3-540-10235-3

R. Milner, Communication and Concurrency. International Series in Computer Science, 1989.

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, I and II. Information and Computation A preliminary version appeared as Technical Reports ECF-LFCS-89-85 and -86, pp.1-40, 1989.

U. Nestmann, What is a ???Good??? Encoding of Guarded Choice?, An extended abstract appeared in the Proceedings of EXPRESS'97, pp.287-319, 2000.
DOI : 10.1006/inco.1999.2822

C. Palamidessi, Comparing the expressive power of the synchronous and asynchronous $pi$ -calculi, Mathematical Structures in Computer Science, vol.13, issue.5, pp.685-719, 2003.
DOI : 10.1017/S0960129503004043
URL : https://hal.archives-ouvertes.fr/inria-00201104

B. C. Pierce and D. N. Turner, Pict: A programming language based on the picalculus, Proof, Language and Interaction: Essays in Honour of Robin Milner, pp.455-494, 1998.

D. Sangiorgi and D. Walker, The ?-calculus: a Theory of Mobile Processes, 2001.

V. A. Saraswat, M. Rinard, and P. Panangaden, The semantic foundations of concurrent constraint programming, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, pp.333-352, 1991.
DOI : 10.1145/99583.99627

P. Selinger, First-order axioms for asynchrony, CONCUR97: Concurrency Theory, pp.376-390, 1997.
DOI : 10.1007/3-540-63141-0_26