M. Abadi and C. Fournet, Mobile values, new names, and secure communication, Proc. of POPL, pp.104-115, 2001.
DOI : 10.1145/360204.360213
URL : https://hal.archives-ouvertes.fr/hal-01423924

M. Abadi and A. Gordon, A calculus for cryptographic protocols, Proceedings of the 4th ACM conference on Computer and communications security , CCS '97, pp.1-70, 1999.
DOI : 10.1145/266420.266432

R. M. Amadio, I. Castellani, and D. Sangiorgi, On bisimulations for the asynchronous ??-calculus, Theoretical Computer Science, vol.195, issue.2, pp.291-324, 1998.
DOI : 10.1016/S0304-3975(97)00223-5
URL : https://hal.archives-ouvertes.fr/inria-00073784

J. Bengtson, M. Johansson, J. Parrow, and B. Victor, Psi-calculi: a framework for mobile processes with nominal data and logic, Logical Methods in Computer Science, vol.7, issue.1, 2011.
DOI : 10.2168/LMCS-7(1:11)2011

M. Boreale, R. De-nicola, and R. Pugliese, Proof Techniques for Cryptographic Processes, SIAM Journal on Computing, vol.31, issue.3, pp.947-986, 2001.
DOI : 10.1137/S0097539700377864
URL : http://basics.sjtu.edu.cn/~yuehg/lics/proof techniques for cryptographic processes 1999.pdf

M. G. Buscemi and U. Montanari, Open bisimulation for the concurrent constraint picalculus, Proc. of ESOP, pp.254-268, 2008.

N. Busi, R. Gorrieri, and G. Zavattaro, A process algebraic view of Linda coordination primitives, Theoretical Computer Science, vol.192, issue.2, pp.167-199, 1998.
DOI : 10.1016/S0304-3975(97)00149-7

M. Carbone and S. Maffeis, On the expressive power of polyadic synchronisation in picalculus, Nordic Journal on Computing, vol.10, issue.2, pp.70-98, 2003.

G. Castagna, Patterns and types for querying xml documents, 10th Inter.Symp.on Database Programming Languages, pp.1-26, 2005.
DOI : 10.1007/11547273_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.98.3642

P. Ciancarini, R. Gorrieri, and G. Zavattaro, Towards a calculus for generative communication, Proc. of FMOODS, pp.283-297, 1996.
DOI : 10.1007/978-0-387-35082-0_21

F. S. De-boer, J. W. Klop, and C. Palamidessi, Asynchronous communication in process algebra, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science, pp.137-147, 1992.
DOI : 10.1109/LICS.1992.185528

R. De-nicola, D. Gorla, and R. Pugliese, Basic observables for a calculus for global computing, Information and Computation, vol.205, issue.10, pp.1491-1525, 2007.
DOI : 10.1016/j.ic.2007.03.004

R. , D. Nicola, and R. Pugliese, A process algebra based on linda, Proc. of COORDINA- TION, pp.160-178, 1996.
DOI : 10.1007/3-540-61052-9_45

C. Fournet and G. Gonthier, The reflexive CHAM and the join-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '96, pp.372-385, 1996.
DOI : 10.1145/237721.237805

C. Fournet and C. Laneve, Bisimulations in the join-calculus, Theoretical Computer Science, vol.266, issue.1-2, pp.569-603, 2001.
DOI : 10.1016/S0304-3975(00)00283-8

D. Gelernter, Generative communication in Linda, ACM Transactions on Programming Languages and Systems, vol.7, issue.1, pp.80-112, 1985.
DOI : 10.1145/2363.2433
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.9679

T. Given-wilson, Concurrent pattern calculus in bondi, Young Researchers Workshop on Concurrency Theory, 2010.
DOI : 10.1007/978-3-642-15240-5_18
URL : http://arxiv.org/abs/1405.1546

T. Given-wilson, Concurrent pattern unification, 2012.

T. Given-wilson, D. Gorla, and B. Jay, Concurrent pattern calculus (extended version)
DOI : 10.1007/978-3-642-15240-5_18
URL : http://arxiv.org/abs/1405.1546

T. Given-wilson, D. Gorla, and B. Jay, Concurrent pattern calculus, Proc. of IFIP-TCS, pp.244-258, 2010.
DOI : 10.1007/978-3-642-15240-5_18
URL : https://hal.archives-ouvertes.fr/hal-01054456

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
URL : http://doi.org/10.1016/0304-3975(95)00074-7

H. Hosoya and B. Pierce, Regular expression pattern matching for XML, Journal of Functional Programming, vol.13, issue.6, pp.961-1004, 2003.
DOI : 10.1017/S0956796802004410
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.178.3491

B. Jay and T. Given-wilson, Abstract, The Journal of Symbolic Logic, vol.2, issue.03, pp.807-826, 2011.
DOI : 10.1145/321738.321750

D. Kozen, A completeness theorem for Kleene algebras and the algebra of regular events, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.366-390, 1994.
DOI : 10.1109/LICS.1991.151646

R. Milner, The Polyadic ??-Calculus: a Tutorial, Logic and Algebra of Specification of Series F. NATO ASI, 1993.
DOI : 10.1007/978-3-642-58041-3_6

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, I, Information and Computation, vol.100, issue.1, pp.1-77, 1992.
DOI : 10.1016/0890-5401(92)90008-4

R. Milner and D. Sangiorgi, Barbed bisimulation, Proc. of ICALP, pp.685-695, 1992.
DOI : 10.1007/3-540-55719-9_114

J. Parrow and B. Victor, The fusion calculus: expressiveness and symmetry in mobile processes, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226), pp.176-185, 1998.
DOI : 10.1109/LICS.1998.705654

D. Sangiorgi, A theory of bisimulation for the ??-calculus, Acta Informatica, vol.XVI, issue.2, pp.69-97, 1996.
DOI : 10.1007/s002360050036

D. Sangiorgi, N. Kobayashi, and E. Sumii, Environmental bisimulations for higher-order languages, ACM Trans. Program. Lang. Syst, vol.33, issue.1, p.5, 2011.
DOI : 10.1145/1889997.1890002
URL : https://hal.archives-ouvertes.fr/hal-01337665