M. Roberto, S. Amadio, and . Dal-zilio, Resource control for synchronous cooperative threads, Theor. Comput. Sci, vol.358, pp.2-3, 2006.

M. Roberto, C. Amadio, and . Meyssonnier, On Decidability of the Control Reachability Problem in the Asynchronous pi-Calculus, Nord. J. Comput, vol.9, issue.1, p.70101, 2002.

M. Benedikt, C. Ley, and G. Puppis, Minimal memory automata, Alberto Mendelzon Workshop on Foundations of Databases, 2010.

J. Gregory and . Chaitin, Register allocation and spilling via graph coloring (with retrospective), Best of PLDI, p.6674, 2004.

P. Degano, G. L. Ferrari, and G. Mezzetti, Nominal Automata for Resource Usage Control, CIAA (LNCS), p.125137, 2012.
DOI : 10.1007/978-3-642-31606-7_11

A. Deharbe and F. Peschanski, The Omniscient Garbage Collector: A Resource Analysis Framework, 2014 14th International Conference on Application of Concurrency to System Design, 2014.
DOI : 10.1109/ACSD.2014.18
URL : https://hal.archives-ouvertes.fr/hal-00973747

G. L. Ferrari, S. Gnesi, U. Montanari, M. Pistore, and G. Ristori, Verifying mobile processes in the HAL environment, CAV (LNCS), p.511515, 1998.
DOI : 10.1007/BFb0028772

D. Andrew and . Gordon, Notes on Nominal Calculi for Security and Mobility, FOSAD (LNCS), 2000.

R. Hüchting, R. Majumdar, and R. Meyer, A Theory of Name Boundedness, In CONCURLNCS), vol.8052, p.182196, 2013.

A. Edward and J. Isper, The Innite State Acceptor and Its Application to AI, SIGART Bull, vol.107, p.2931, 1989.

T. Jensen and B. Toft, Graph coloring problems, 2011.
DOI : 10.1002/9781118032497

M. Kaminski and N. Francez, Finite-Memory Automata, Theor. Comput. Sci, vol.134, issue.2, p.329363, 1994.
DOI : 10.1109/fscs.1990.89590

N. Kobayashi, K. Suenaga, and L. Wischik, Resource Usage Analysis for the pi-Calculus, Logical Methods in Computer Science, vol.2, p.3, 2006.
DOI : 10.1007/11609773_20
URL : http://www.kb.ecei.tohoku.ac.jp/~koba/papers/VMCAI2006.pdf

U. Montanari and M. Pistore, Checking Bisimilarity for Finitary pi-Calculus, In CONCUR (LNCS), vol.962, p.4256, 1995.
DOI : 10.1007/3-540-60218-6_4

F. Peschanski, H. Klaudel, and R. R. Devillers, A Petri Net Interpretation of Open Recongurable Systems, Fundam. Inform, vol.122, pp.1-2, 2013.
DOI : 10.1007/978-3-642-21834-7_12
URL : http://hal.archives-ouvertes.fr/docs/00/62/84/89/PDF/pigraph-PN-2011-submit.pdf

F. Rosa-velardo and D. De-frutos-escrig, Decidability Problems in Petri Nets with Names and Replication, Fundam. Inform, vol.105, pp.3-291317, 2010.

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

N. Tzevelekos, Fresh-register automata, Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, p.295306, 2011.
DOI : 10.1145/1925844.1926420
URL : http://www.cs.ox.ac.uk/people/nikos.tzevelekos/FRA_11.pdf