M. Boreale and R. De-nicola, Testing Equivalence for Mobile Processes, Information and Computation, pp.279-303, 1995.
DOI : 10.1007/bfb0084779
URL : http://basics.sjtu.edu.cn/~yuehg/concur/testing equivalence for mobile processes 92.pdf

G. Boudol, Asynchrony and the ?-calculus, 1992.
URL : https://hal.archives-ouvertes.fr/inria-00076939

. E. Brinksma, A. Rensink, and W. Vogler, Applications of Fair Testing, Protocols Specification, Testing and Verification " (XVI), pp.145-160, 1996.
DOI : 10.1007/978-0-387-35079-0_9

D. Cacciagrano, F. Corradini, and C. Palamidessi, Separation of Synchronous and Asynchronous Communication Via Testing, Proc. of EXPRESS'05, pp.95-108, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00201107

F. Corradini, D. Berardini, M. R. Vogler, and W. , Relating Fairness and Timing in Process Algebras, Proc. of Concur'03, pp.2761-438, 2003.
DOI : 10.1007/978-3-540-45187-7_29

C. Fournet and G. Gonthier, A Hierarchy of Equivalences for Asynchronous Calculi, Proc. of ICALP'98, pp.844-855, 1998.

G. Costa and C. Stirling, A fair calculus of communicating systems, Acta Informatica, vol.85, issue.5, pp.417-441, 1984.
DOI : 10.1007/BF00271640

G. Costa and C. Stirling, Weak and strong fairness in CCS, Information and Computation, vol.73, issue.3, pp.207-244, 1987.
DOI : 10.1016/0890-5401(87)90013-7

N. Francez, Fairness, 1986.
DOI : 10.1007/978-1-4612-4886-6

M. Hennessy, An algebraic theory of fair asynchronous communicating processes, Theoretical Computer Science, vol.49, issue.2-3, pp.121-143, 1987.
DOI : 10.1016/0304-3975(87)90004-1

K. Honda and M. Tokoro, An object calculus for asynchronous communication, Proc. of ECOOP '91, pp.512-133, 1991.
DOI : 10.1007/BFb0057019
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.4500

K. Honda and N. Yoshida, Replication in concurrent combinators, Proc. of TACS '94, p.789, 1994.
DOI : 10.1007/3-540-57887-0_125
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.4491

C. Koomen, Algebraic specification and verification of communication protocols, Science of Computer Programming, vol.5, pp.1-36, 1985.
DOI : 10.1016/0167-6423(85)90002-4
URL : http://doi.org/10.1016/0167-6423(85)90002-4

D. Lehmann, A. Pnueli, and J. Stavi, Impartiality, justice and Fairness:the Ethics of Concurrent Termination, Proc. of 8th Int. Colloq. Aut. Lang. Prog, pp.115-264, 1981.

R. Milner, Communication and Concurrency, 1989.

R. Milner, J. Parrow, and D. Walker, A Calculus of Mobile Processes, Part I and II, Information and Computation, pp.1-78, 1992.

M. Núñez and D. Rupérez, Fair testing through probabilistic testing, Acta Informatica Protocol Specification, Testing, and Verification, vol.19, issue.19, pp.195-210, 1983.

A. Pnueli, On the extremely fair treatment of probabilistic algorithms, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.278-290, 1983.
DOI : 10.1145/800061.808757

J. P. Queille and J. Sifakis, Fairness and related properties in transition systems ? a temporal logic to deal with fairness, Acta Informatica, vol.19, issue.3, pp.195-210, 1983.
DOI : 10.1007/BF00265555