J. Aranda, F. D. Valencia, and C. Versari, On the Expressive Power of Restriction and Priorities in CCS with Replication, Foundations of Software Science and Computational Structures, 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software Proceedings, volume 5504 of Lecture Notes in Computer Science, pp.242-256, 2009.
DOI : 10.1007/978-3-540-85361-9_37
URL : https://hal.archives-ouvertes.fr/inria-00430531

P. Baldan, F. Bonchi, F. Gadducci, and G. V. Monreale, Modular encoding of synchronous and asynchronous interactions using open Petri nets, Science of Computer Programming, vol.109, p.96124, 2015.
DOI : 10.1016/j.scico.2014.11.019
URL : https://hal.archives-ouvertes.fr/hal-01284925

N. Busi, M. Gabbrielli, and G. Zavattaro, On the expressive power of recursion, replication and iteration in process calculi, Mathematical Structures in Computer Science, vol.2987, issue.06, pp.1191-1222, 2009.
DOI : 10.1145/321160.321170

N. Busi, R. Gorrieri, and G. Zavattaro, On the Expressiveness of Linda Coordination Primitives, Information and Computation, vol.156, issue.1-2, pp.90-121, 2000.
DOI : 10.1006/inco.1999.2823

N. Busi and G. Zavattaro, On the expressiveness of event notification in datadriven coordination languages Held as Part of the European Joint Conferences on the Theory and Practice of Software, Programming Languages and Systems, 9th European Symposium on Programming Proceedings, volume 1782 of Lecture Notes in Computer Science, pp.41-55, 2000.

N. Busi and G. Zavattaro, Expired data collection in shared dataspaces, Theoretical Computer Science, vol.298, issue.3, pp.529-556, 2003.
DOI : 10.1016/S0304-3975(02)00867-8

P. Degano, R. De-nicola, and U. Montanari, A distributed operational semantics for CCS based on condition/event systems, Acta Informatica, vol.72, issue.1-2, pp.59-91, 1988.
DOI : 10.1007/BF02915446

G. Delzanno and G. Zavattaro, Reachability problems in BioAmbients, Theoretical Computer Science, vol.431, pp.56-74, 2012.
DOI : 10.1016/j.tcs.2011.12.056

C. Dufourd, A. Finkel, and P. Schnoebelen, Reset nets between decidability and undecidability, Automata, Languages and Programming, 25th International Colloquium , ICALP'98 Proceedings, volume 1443 of Lecture Notes in Computer Science, pp.103-115, 1998.
DOI : 10.1007/BFb0055044
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.3693

J. Esparza and M. Nielsen, Decidability issues for petri nets -a survey, Bulletin of the EATCS, vol.52, pp.244-262, 1994.

A. Finkel, J. Raskin, M. Samuelides, and L. V. Begin, Monotonic Extensions of Petri Nets, Electronic Notes in Theoretical Computer Science, vol.68, issue.6, pp.85-106, 2002.
DOI : 10.1016/S1571-0661(04)80535-8
URL : https://hal.archives-ouvertes.fr/hal-00158709

E. W. Mayr, An algorithm for the general petri net reachability problem, Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pp.238-246, 1981.

R. Meyer and R. Gorrieri, On the Relationship between ??-Calculus and Finite Place/Transition Petri Nets, CONCUR 2009 -Concurrency Theory, 20th International Conference Proceedings, pp.463-480, 2009.
DOI : 10.1007/3-540-60218-6_4

R. Milner, Communication and concurrency. PHI Series in computer science, 1989.

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

A. I. Rowstron and A. Wood, Solving the Linda multiple rd problem using the copy-collect primitive, Science of Computer Programming, vol.31, issue.2-3, pp.335-358, 1998.
DOI : 10.1016/S0167-6423(97)00026-9

J. C. Shepherdson and J. E. Sturgis, Computability of Recursive Functions, Journal of the ACM, vol.10, issue.2, pp.217-255, 1963.
DOI : 10.1145/321160.321170