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

D. Bo?na?ki, A. Donaldson, M. Leuschel, and T. Massart, Efficient Approximate Verification of Promela Models Via Symmetry Markers, LNCS, vol.4762, pp.300-315, 2007.
DOI : 10.1007/978-3-540-75596-8_22

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

J. Dean and S. Ghemawat, MapReduce, Communications of the ACM, vol.51, issue.1, pp.107-113, 2008.
DOI : 10.1145/1327452.1327492

A. Aldini, M. Bernardo, and F. Corradini, A Process Algebraic Approach to Software Architecture Design, 2009.
DOI : 10.1007/978-1-84800-223-4

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

M. Tribastone, A. Duguid, and S. Gilmore, The PEPA eclipse plugin, ACM SIGMETRICS Performance Evaluation Review, vol.36, issue.4, pp.28-33, 2009.
DOI : 10.1145/1530873.1530880

R. Milner, An algebraic definition of simulation between programs, In: IJCAI, pp.481-489, 1971.

M. R. Henzinger, T. A. Henzinger, and P. W. Kopke, Computing simulations on finite and infinite graphs, Proceedings of IEEE 36th Annual Foundations of Computer Science, pp.453-462, 1995.
DOI : 10.1109/SFCS.1995.492576

P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, pp.238-252, 1977.
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/hal-01108790

E. M. Clarke, O. Grumberg, and D. E. Long, Model checking and abstraction, ACM Transactions on Programming Languages and Systems, vol.16, issue.5, pp.1512-1542, 1994.
DOI : 10.1145/186025.186051

D. Dams, R. Gerth, and O. Grumberg, Abstract interpretation of reactive systems, ACM Transactions on Programming Languages and Systems, vol.19, issue.2, pp.253-291, 1997.
DOI : 10.1145/244795.244800

H. Fecher and M. Huth, Model Checking for Action Abstraction, LNCS, vol.4905, pp.112-126, 2008.
DOI : 10.1007/978-3-540-78163-9_13

B. Thomsen, An extended bisimulation induced by a preorder on actions, 1987.

V. Galpin, Equivalences for a biological process algebra, Theoretical Computer Science, vol.412, issue.43, pp.6058-6082, 2011.
DOI : 10.1016/j.tcs.2011.07.006

A. Fantechi, S. Gnesi, and D. Latella, Towards automatic temporal logic verification of value passing process algebra using abstract interpretation, LNCS, vol.1119, pp.563-578, 1996.
DOI : 10.1007/3-540-61604-7_76

R. Glabbeek and U. Goltz, Equivalence notions for concurrent systems and refinement of actions, LNCS, vol.379, pp.237-248, 1989.
DOI : 10.1007/3-540-51486-4_71

L. Aceto and M. Hennessy, Towards Action-Refinement in Process Algebras, Information and Computation, vol.103, issue.2, pp.204-269, 1993.
DOI : 10.1006/inco.1993.1019

R. Gorrieri, A. Rensink, and M. A. Zamboni, Action Refinement, Handbook of Process Algebra, pp.1047-1147, 2000.
DOI : 10.1016/B978-044482830-9/50034-5

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

B. Bloom, S. Istrail, and A. R. Meyer, Bisimulation can't be traced, Journal of the ACM, vol.42, issue.1, pp.232-268, 1995.
DOI : 10.1145/200836.200876