J. Hopcroft, A. Aho, and J. Ullman, Design and Analysis of Computer Algorithms, 1974.

S. Arun-kumar and M. Hennessy, An efficiency preorder for processes, Theoretical Aspects of Computer Software (TACS'91), 1991.
DOI : 10.1007/3-540-54415-1_45
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8574

S. Arun-kumar and M. Hennessy, An efficiency preorder for processes, Acta Informatica, vol.25, issue.1, pp.737-760, 1992.
DOI : 10.1007/BF01191894

S. Arun-kumar and V. Natarajan, Conformance: A Precongruence close to Bisimilarity, Structures in Concurrency Theory, volume Springer Workshops in Computer Science Series, 1995.
DOI : 10.1007/978-1-4471-3078-9_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.2355

R. Cleaveland and M. Hennessy, Testing equivalence as a bisimulation equivalence, Formal Aspects of Computing, vol.85, issue.n. 2, pp.1-20, 1993.
DOI : 10.1007/BF01211314
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.5165

R. Cleaveland and O. Sokolsky, Equivalence and preorder checking for finitestate system. Handbook of Process Algebra, 2001.
DOI : 10.1016/b978-044482830-9/50024-2

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, 1987.
DOI : 10.1145/28395.28396
URL : http://doi.org/10.1016/s0747-7171(08)80013-2

M. Gaur and M. Hennessy, Counting the cost in the picalculus (extended abstract), Electronic Notes in Theoretical Computer Science (ENTCS), vol.229, issue.3, pp.117-129, 2009.

J. F. Groote and F. W. Vaandrager, An efficient algorithm for branching bisimulation and stuttering equivalence, Proceedings 17th ICALP, 1990.
DOI : 10.1007/BFb0032063
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.1834

M. Hennessy, Algebraic Theory of Processes, 1990.

C. Hoare, Communicating Sequential Processes, 1985.
DOI : 10.1145/357980.358021
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.6772

E. John, . Hopcroft, D. Jeffery, and . Ullman, Intoduction to Automata Theory, Langauages and Computation, 1987.

P. Kanellakis and S. Smolka, CCS expressions, finite state processes, and three problems of equivalence, Information and Computation, vol.86, issue.1, pp.43-68, 1990.
DOI : 10.1016/0890-5401(90)90025-D

R. Milner, Communication and Concurrency, 1989.

R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol.92, 1980.
DOI : 10.1007/3-540-10235-3

R. Milner, Communicating and mobile systems: The ?-Calculus, 1999.

R. Paige and R. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987.
DOI : 10.1137/0216062

J. Parrow, R. Cleaveland, and B. Steffen, The concurrency workbench: A semantic based tool for the verification of the concurrent systems, ACM Transactions of Programming Languages and Systems, vol.15, issue.1, 1993.

D. Sangiorgi, Beyond Bisimulation: The ???up-to??? Techniques, 4th International Symposium, FMCO 2005, 2006.
DOI : 10.1007/11804192_8

D. Sangiorgi, Introduction to Bisimulation and Coinduction, 2012.
DOI : 10.1017/CBO9780511777110
URL : https://hal.archives-ouvertes.fr/hal-00907026

D. Sangiorgi and R. Milner, The problem of ???weak bisimulation up to???, Lecture Notes in Computer science, vol.630, issue.92, 1992.
DOI : 10.1007/BFb0084781

E. Charles, H. Thomas, . Cormen, L. Ronald, and . Rivest, Introduction to Algorithms. Eastern Economy Edition, 1990.