M. Abadi and C. Fournet, Mobile values, new names, and secure communication, POPL, pp.104-115, 2001.
DOI : 10.1145/373243.360213

URL : https://hal.archives-ouvertes.fr/hal-01423924

M. Abadi and A. D. 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

L. Aceto and A. Ingólfsdóttir, On the expressibility of priority, Information Processing Letters, vol.109, issue.1, pp.83-85, 2008.
DOI : 10.1016/j.ipl.2008.09.002

J. Alves-foss, An efficient secure authenticated group key exchange algorithm for large and dynamic groups, Proceedings of the 23rd National Information Systems Security Conference, 2000.

R. Amadio, D. Lugiez, and V. Vanackère, On the symbolic reduction of processes with cryptographic functions, Theoretical Computer Science, vol.290, issue.1, pp.695-740, 2003.
DOI : 10.1016/S0304-3975(02)00090-7

URL : https://hal.archives-ouvertes.fr/inria-00072478

R. Amadio and C. Meyssonnier, On decidability of the control reachability problem in the asynchronous ??calculus, Nordic Journal of Computing, vol.9, issue.2, 2002.

J. Aranda, C. D. Giusto, M. Nielsen, and F. D. Valencia, CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence, Lecture Notes in Computer Science, vol.4807, pp.383-398, 2007.
DOI : 10.1007/978-3-540-76637-7_26

URL : https://hal.archives-ouvertes.fr/inria-00201547

J. Aranda, F. D. Valencia, and C. Versari, On the Expressive Power of Restriction and Priorities in CCS with Replication
DOI : 10.1007/978-3-540-85361-9_37

URL : https://hal.archives-ouvertes.fr/inria-00430531

J. C. Baeten, J. A. Bergstra, and J. W. Klop, Decidability of bisimulation equivalence for processes generating context-free languages, J.ACM, vol.40, issue.3, pp.653-682, 1993.
DOI : 10.1007/3-540-17945-3_5

J. C. Baeten and F. Corradini, Regular Expressions in Process Algebra, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.12-19, 2005.
DOI : 10.1109/LICS.2005.43

E. Best, F. De-boer, and C. Palamidessi, Partial order and SOS semantics for linear constraint programs, Lecture Notes in Computer Science, vol.1282, pp.256-273, 1997.
DOI : 10.1007/3-540-63383-9_85

B. Blanchet, Security protocols: from linear to classical logic by abstract interpretation, Information Processing Letters, vol.95, issue.5, pp.473-479, 2005.
DOI : 10.1016/j.ipl.2005.05.011

M. Boreale and M. Buscemi, A Framework for the Analysis of Security Protocols*, Lecture Notes in Computer Science, vol.2421, pp.483-498, 2002.
DOI : 10.1007/3-540-45694-5_32

E. Borger, E. Gradel, and Y. Gurevich, The Classical Decision Problem, 1994.
DOI : 10.1007/978-3-642-59207-2

G. Boudol, Asynchrony and the pi-calculus, 1992.
URL : https://hal.archives-ouvertes.fr/inria-00076939

M. Bravetti and G. Zavattaro, On the expressive power of process interruption and compensation, Mathematical Structures in Computer Science, vol.4960, issue.03, pp.565-599, 2009.
DOI : 10.1007/s10270-006-0012-1

E. Brinksma, A. Rensink, and W. Vogler, Fair testing, Lecture Notes in Computer Science, vol.962, pp.313-327, 1995.
DOI : 10.1007/3-540-60218-6_23

S. D. Brookes, C. A. Hoare, and A. 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

O. Burkart, D. Caucal, F. Moller, and B. Steffen, Verification on Infinite Structures, pp.545-623, 2001.
DOI : 10.1016/B978-044482830-9/50027-8

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

N. Busi, Analysis issues in Petri nets with inhibitor arcs, Theoretical Computer Science, vol.275, issue.1-2, pp.127-177, 2002.
DOI : 10.1016/S0304-3975(01)00127-X

N. Busi, M. Gabbrielli, and G. Zavattaro, Replication vs. Recursive Definitions in Channel Based Calculi, ICALP'03, pp.133-144, 2003.
DOI : 10.1007/3-540-45061-0_12

N. Busi, M. Gabbrielli, and G. Zavattaro, Comparing Recursion, Replication, and Iteration in Process Calculi, ICALP'04, pp.307-319, 2004.
DOI : 10.1007/978-3-540-27836-8_28

D. Cacciagrano, On Synchronous and Asynchronous Communication: Some Expressiveness Results, 2004.

D. Cacciagrano and F. Corradini, On Synchronous and Asynchronous Communication Paradigms, Lecture Notes in Computer Science, vol.2202, pp.256-268, 2001.
DOI : 10.1007/3-540-45446-2_16

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

D. Cacciagrano, F. Corradini, J. Aranda, and F. D. Valencia, Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus, Electronic Notes in Theoretical Computer Science, vol.194, issue.2, pp.59-84, 2008.
DOI : 10.1016/j.entcs.2007.11.006

URL : https://hal.archives-ouvertes.fr/inria-00201502

D. Cacciagrano, F. Corradini, and C. Palamidessi, Separation of synchronous and asynchronous communication via testing, Electr. Notes Theor. Comput
URL : https://hal.archives-ouvertes.fr/inria-00201107

M. Carbone and S. Maffeis, On the expressive power of polyadic synchronisation in pi-calculus, Nord. J. Comput, vol.10, issue.2, pp.70-98, 2003.

S. Christensen, Decidability and Decomposition in Process Algebras, 1993.

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

F. Crazzolara, Language, Semantics, and Methods for Security Protocols, 2003.

F. Crazzolara and G. Winskel, Events in security protocols, ACM Conference on Computer and Communications Security, pp.96-105, 2001.

C. Eccher and C. Priami, Design and implementation of a tool for translating SBML into the biochemical stochastic ??-calculus, Bioinformatics, vol.22, issue.24, pp.3075-3081, 2006.
DOI : 10.1093/bioinformatics/btl516

J. Esparza and M. Nielsen, Decidability Issues for Petri Nets, BRICS Report Series, vol.1, issue.8, 1994.
DOI : 10.7146/brics.v1i8.21662

F. Fages, P. Ruet, and S. Soliman, Linear Concurrent Constraint Programming: Operational and Phase Semantics, Information and Computation, vol.165, issue.1, pp.14-41, 2001.
DOI : 10.1006/inco.2000.3002

URL : https://hal.archives-ouvertes.fr/hal-01431358

M. Fiore and M. Abadi, Computing symbolic models for verifying cryptographic protocols, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., pp.160-173, 2001.
DOI : 10.1109/CSFW.2001.930144

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

C. Fournet and M. Abadi, Hiding Names: Private Authentication in the Applied Pi Calculus, Lecture Notes in Computer Science, vol.2609, pp.317-338, 2002.
DOI : 10.1007/3-540-36532-X_20

S. J. Gay and M. Hole, Subtyping for session types in the pi calculus, Acta Informatica, vol.Analysis, issue.1, pp.191-225, 2005.
DOI : 10.1007/s00236-005-0177-z

P. Giambiagi, G. Schneider, and F. D. Valencia, On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi, Lecture Notes in Computer Science, vol.2987, 2004.
DOI : 10.1007/978-3-540-24727-2_17

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4

URL : https://hal.archives-ouvertes.fr/inria-00075966

M. Giunti, K. Honda, V. T. Vasconcelos, and N. Yoshida, Session-based type discipline for pi calculus with matching, Presented at PLACES 2009 ? 2nd International Workshop in Programming Language Approaches to Concurrency and Communication-cEntric Software, 2009.

C. D. Giusto, J. A. Pérez, and G. Zavattaro, On the Expressiveness of Forwarding in Higher-Order Communication, Lecture Notes in Computer Science, vol.5684, pp.155-169, 2009.
DOI : 10.1007/978-3-642-03466-4_10

U. Goltz, CCS and petri nets, Semantics of Systems of Concurrent Processes, pp.334-357, 1990.
DOI : 10.1007/3-540-53479-2_14

D. Gorla, On the Relative Expressive Power of Asynchronous Communication Primitives, FoSSaCS, pp.47-62, 2006.
DOI : 10.1007/11690634_4

D. Gorla, Synchrony vs Asynchrony in Communication Primitives, Electronic Notes in Theoretical Computer Science, vol.175, issue.3, pp.87-108, 2007.
DOI : 10.1016/j.entcs.2006.10.054

D. Gorla, Towards a unified approach to encodability and separation results for process calculi, pp.492-507

Y. Hirshfeld, Petri nets and the equivalence problem, Proceedings of CSL'93, pp.165-174, 1993.
DOI : 10.1007/BFb0049331

K. Honda and M. Tokoro, An object calculus for asynchronous communication, Lecture Notes in Computer Science, vol.512, pp.133-147, 1991.
DOI : 10.1007/BFb0057019

H. Huttel and J. Srba, Recursion vs. Replication in Simple Cryptographic Protocols, SOFSEM'05, pp.175-184, 2005.
DOI : 10.7146/brics.v11i23.21848

C. B. Jones, A pi-calculus semantics for an object-based design notation, Lecture Notes in Computer Science, vol.715, pp.158-172, 1993.
DOI : 10.1007/3-540-57208-2_12

P. C. Kanellakis and S. A. 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

N. Kobayashi and T. Suto, Undecidability of bpp equivalences revisited, 2007.

C. Laneve and A. Vitale, Expressivity in the ?? Family, Electronic Notes in Theoretical Computer Science, vol.218, pp.97-109, 2008.
DOI : 10.1016/j.entcs.2008.10.007

R. Lucchi and M. Mazzara, A pi-calculus based semantics for WS-BPEL, The Journal of Logic and Algebraic Programming, vol.70, issue.1, pp.96-118, 2007.
DOI : 10.1016/j.jlap.2006.05.007

S. Maffeis and I. Phillips, On the computational strength of pure ambient calculi, EXPRESS'03, 2003.

Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems, Specification, 1991.

R. Milner, A complete inference system for a class of regular behaviours, Journal of Computer and System Sciences, vol.28, issue.3, pp.439-466, 1984.
DOI : 10.1016/0022-0000(84)90023-0

R. Milner, Communication and Concurrency. International Series in Computer Science, 1989.

R. Milner, Communication and Concurrency, 1989.

R. Milner, Communicating and Mobile Systems: the ?-calculus, 1999.

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, Information and Computation, vol.100, 1992.

M. Minsky, Computation: finite and infinite machines, 1967.

U. Nestmann, What is a 'good' encoding of guarded choice? Electr. Notes Theor, Comput. Sci, vol.7, 1997.

R. D. 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

M. Nielsen, C. Palamidessi, and F. Valencia, On the expressive power of concurrent constraint programming languages, PPDP 2002, pp.156-167, 2002.

C. Olarte, Universal Temporal Concurrent Constraint Programming, 2009.
DOI : 10.1007/978-3-540-74610-2_47

URL : https://hal.archives-ouvertes.fr/tel-00430446

C. Olarte and F. D. Valencia, The expressivity of universal timed CCP, Proceedings of the 10th international ACM SIGPLAN symposium on Principles and practice of declarative programming, PPDP '08, 2008.
DOI : 10.1145/1389449.1389452

URL : https://hal.archives-ouvertes.fr/inria-00349353

C. Palamidessi, Comparing the expressive power of the synchronous and asynchronous $pi$ -calculi, Mathematical Structures in Computer Science, vol.13, issue.5, pp.685-719, 2003.
DOI : 10.1017/S0960129503004043

URL : https://hal.archives-ouvertes.fr/inria-00201104

C. Palamidessi, V. A. Saraswat, F. D. Valencia, and B. Victor, On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pp.59-68, 2006.
DOI : 10.1109/LICS.2006.39

URL : https://hal.archives-ouvertes.fr/inria-00201096

C. Palamidessi and F. D. Valencia, Recursion vs replication in process calculi: Expressiveness, Bulletin of the EATCS, vol.87, pp.105-125, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00201158

J. Parrow, Trios in concert, Proof, Language and Interaction: Essays in Honour of Robin Milner, pp.621-637, 2000.

L. C. Paulson, Mechanized proofs for a recursive authentication protocol, Proceedings 10th Computer Security Foundations Workshop, pp.84-95, 1997.
DOI : 10.1109/CSFW.1997.596790

A. Phillips and L. Cardelli, Efficient, Correct Simulation of Biological Processes in the Stochastic Pi-calculus, Lecture Notes in Computer Science, vol.4695, pp.184-199, 2007.
DOI : 10.1007/978-3-540-75140-3_13

A. Phillips, L. Cardelli, and G. Castagna, A Graphical Representation for Biological Processes in the Stochastic pi-Calculus, pp.123-152, 2006.
DOI : 10.1007/11905455_7

URL : https://hal.archives-ouvertes.fr/hal-00152518

I. Phillips, CCS with priority guards, The Journal of Logic and Algebraic Programming, vol.75, issue.1, pp.139-165, 2008.
DOI : 10.1016/j.jlap.2007.06.005

URL : http://basics.sjtu.edu.cn/~yuehg/concur/ccs with priority guards (2001).pdf

B. C. Pierce, Concurrent objects in a process calculus, Theory and Practice of Parallel Programming, pp.187-215, 1994.
DOI : 10.1007/BFb0026570

B. C. Pierce and D. N. Turner, Pict: a programming language based on the pi-calculus, Proof, Language, and Interaction, pp.455-494, 2000.

K. V. Prasad, Broadcast Calculus Interpreted in CCS upto Bisimulation, Electronic Notes in Theoretical Computer Science, vol.52, issue.1, 2001.
DOI : 10.1016/S1571-0661(04)00218-X

F. Puhlmann, Soundness Verification of Business Processes Specified in the Pi-Calculus, OTM Conferences, pp.6-23, 2007.
DOI : 10.1007/978-3-540-76848-7_3

W. Reisig, Petri Nets: An Introduction, volume 4 of Monographs in Theoretical Computer Science. An EATCS Series, 1985.

D. Sangiorgi, The name discipline of uniform receptiveness, Theoretical Computer Science, vol.221, issue.1-2, pp.457-493, 1999.
DOI : 10.1016/S0304-3975(99)00040-7

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

V. Saraswat, Concurrent constraint programming, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, 1993.
DOI : 10.1145/96709.96733

V. Saraswat and P. Lincoln, Higher-order linear concurrent constraint programming, 1992.

H. Smith and P. Fingar, Business Process Management: The Third Wave, 2003.

D. Taubner, Finite representation of CCS and TCSP programs by automata and Petri nets, LNCS 369, 1989.

W. M. Van-der-aalst, Pi calculus versus Petri nets: Let us eat humble pie rather than further inflate the Pi hype, 2004.

V. T. Vasconcelos, Fundamentals of Session Types, Lecture Notes in Computer Science, vol.5569, pp.158-186, 2009.
DOI : 10.1007/978-3-642-01918-0_4

C. Versari, N. Busi, and R. Gorrieri, On the Expressive Power of Global and Local Priority in Process Calculi, In CONCUR LNCS, vol.4703, pp.241-255, 2007.
DOI : 10.1007/978-3-540-74407-8_17

M. Vigliotti, I. Phillips, and C. Palamidessi, Separation Results Via Leader Election Problems, Lecture Notes in Computer Science, vol.4111, pp.172-194, 2005.
DOI : 10.1007/11804192_9

URL : https://hal.archives-ouvertes.fr/inria-00201071

G. Zavattaro and L. Cardelli, Termination Problems in Chemical Kinetics, van Breugel and Chechik, pp.477-491
DOI : 10.1007/978-3-540-85361-9_37