M. Alexander and &. W. Gardner, Process Algebra for Parallel and Distributed Processing, 2008.
DOI : 10.1201/9781420064872

J. C. Baeten and &. J. Bergstra, Global renaming operators in concrete process algebra, Information and Computation, vol.78, issue.3, pp.205-245, 1988.
DOI : 10.1016/0890-5401(88)90027-2

J. A. Bergstra and &. J. Klop, Algebra of communicating processes with abstraction, Theoretical Computer Science, vol.37, issue.1, pp.77-121, 1985.
DOI : 10.1016/0304-3975(85)90088-X

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

R. De-nicola and &. M. Hennessy, Testing equivalences for processes, Theoretical Computer Science, vol.34, issue.1-2, pp.83-133, 1984.
DOI : 10.1016/0304-3975(84)90113-0

R. J. Van-glabbeek and &. M. Voorhoeve, Liveness, Fairness and Impossible Futures, LNCS, vol.4137, pp.126-141, 2006.
DOI : 10.1007/11817949_9

R. J. Van-glabbeek, The Linear Time ? Branching Time Spectrum I; The Semantics of Concrete, Sequential Processes, Handbook of Process Algebra, pp.3-99, 2001.

R. Kaivola and &. A. Valmari, The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic, CONCUR'92, pp.207-221, 1992.
DOI : 10.1007/BFb0084793

L. Lamport, Proving the Correctness of Multiprocess Programs, IEEE Transactions on Software Engineering, vol.3, issue.2, pp.125-143, 1977.
DOI : 10.1109/TSE.1977.229904

L. Lamport, Proving possibility properties, Theoretical Computer Science, vol.206, issue.1-2, pp.341-352, 1998.
DOI : 10.1016/S0304-3975(98)00129-7
URL : http://doi.org/10.1016/s0304-3975(98)00129-7

P. B. Levy, Infinite trace equivalence, Annals of Pure and Applied Logic, vol.15123, pp.170-198, 2008.
DOI : 10.1016/j.entcs.2005.11.069
URL : http://doi.org/10.1016/j.entcs.2005.11.069

R. Milner, Operational and algebraic semantics of concurrent processes Handbook of Theoretical Computer Science, chapter 19 Alternatively see Communication and Concurrency, of which an earlier version appeared as A Calculus of Communicating Systems, pp.1201-1242, 1980.

A. Puhakka, Weakest Congruence Results Concerning ???Any-Lock???, Proceedings TACS'01, pp.400-419, 2001.
DOI : 10.1007/3-540-45500-0_20

A. W. Roscoe, Seeing Beyond Divergence, Years Communicating Sequential Processes, pp.25-40, 2004.
DOI : 10.1007/11423348_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.1076

A. W. Roscoe, The Theory and Practice of Concurrency, 1997.