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, APLAS 2007, pp.383-398, 2007.
DOI : 10.1007/978-3-540-76637-7_26
URL : https://hal.archives-ouvertes.fr/inria-00201547

J. Aranda, F. Valencia, and C. Versari, On the Expressive Power of Restriction and Priorities in CCS with Replication, 2008.
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

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

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

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

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

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

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

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

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

R. Milner, Communication and Concurrency, 1989.

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

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

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

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

G. Zavattaro and L. Cardelli, Termination Problems in Chemical Kinetics, In CONCUR LNCS, vol.5201, pp.477-491, 2008.
DOI : 10.1007/978-3-540-85361-9_37