Z. Cao, More on bisimulations for higher order pi-calculus

S. Christensen, Y. Hirshfeld, and F. Moller, Decidable Subsets of CCS, The Computer Journal, vol.37, issue.4, pp.233-242, 1994.
DOI : 10.1093/comjnl/37.4.233

A. Dovier, C. Piazza, and A. Policriti, An efficient algorithm for computing bisimulation equivalence, Theoretical Computer Science, vol.311, issue.1-3, pp.221-256, 2004.
DOI : 10.1016/S0304-3975(03)00361-X

D. Hirschkoff and D. Pous, A distribution law for CCS and a new congruence result for the pi-calculus, Proc. of FoS- SaCS'07, pp.228-242, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00089219

K. Honda and N. Yoshida, On reduction-based process semantics, Theoretical Computer Science, vol.151, issue.2, pp.437-486, 1995.
DOI : 10.1016/0304-3975(95)00074-7

D. J. Howe, Proving Congruence of Bisimulation in Functional Programming Languages, Information and Computation, vol.124, issue.2, pp.103-112, 1996.
DOI : 10.1006/inco.1996.0008

P. Jan?ar, Undecidability of bisimilarity for Petri nets and some related problems, Theoretical Computer Science, vol.148, issue.2, pp.281-301, 1995.
DOI : 10.1016/0304-3975(95)00037-W

A. Jeffrey and J. Rathke, Contextual equivalence for higherorder pi-calculus revisited, Log. Meth. Comput. Sci, vol.1, issue.1, pp.1-22, 2005.

A. Ku?era and P. Jan?ar, Equivalence-checking on infinitestate systems: Techniques and results, TPLP, vol.6, issue.3, pp.227-264, 2006.

I. Lanese, J. A. Pérez, D. Sangiorgi, and A. Schmitt, On the Expressiveness and Decidability of Higher-Order Process Calculi (Extended Version), 2008.

R. Milner and F. Moller, Unique decomposition of processes, Theoretical Computer Science, vol.107, issue.2, pp.357-363, 1993.
DOI : 10.1016/0304-3975(93)90176-T

M. Minsky, Computation: Finite and Infinite Machines, 1967.

I. Phillips and M. G. Vigliotti, Symmetric electoral systems for ambient calculi, Information and Computation, vol.206, issue.1, pp.34-72, 2008.
DOI : 10.1016/j.ic.2007.08.005

E. L. Post, A variant of a recursively unsolvable problem. Bull. of the Am, Math. Soc, vol.52, pp.264-268, 1946.

D. Sangiorgi, Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, 1992.

D. Sangiorgi, The lazy lambda calculus in a concurrency scenario, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp.120-153, 1994.
DOI : 10.1109/LICS.1992.185524

D. Sangiorgi, Bisimulation for Higher-Order Process Calculi, Information and Computation, vol.131, issue.2, pp.141-178, 1996.
DOI : 10.1006/inco.1996.0096
URL : https://hal.archives-ouvertes.fr/inria-00074170

D. Sangiorgi, N. Kobayashi, and E. Sumii, Environmental bisimulations for higher-order languages, Proc. of LICS'07, pp.293-302, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01337665

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

P. Schnoebelen, Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems, Proc. of TACS'01, pp.385-399, 2001.
DOI : 10.1007/3-540-45500-0_19

M. Sipser, Introduction to the Theory of Computation, ACM SIGACT News, vol.27, issue.1, 2005.
DOI : 10.1145/230514.571645

B. Thomsen, A calculus of higher order communicating systems, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '89, pp.143-154, 1989.
DOI : 10.1145/75277.75290

B. Thomsen, Calculi for Higher Order Communicating Systems, 1990.

B. Thomsen, Plain CHOCS A second generation calculus for higher order processes, Acta Informatica, vol.5, issue.2, pp.1-59, 1993.
DOI : 10.1007/BF01200262

X. Xu, On the Bisimulation Theory and Axiomatization of Higher-order Process Calculi, 2007.