Ö. Babaoglu, G. Canright, A. Deutsch, G. D. Caro, F. Ducatelle et al., Design patterns from biology for distributed computing, ACM Transactions on Autonomous and Adaptive Systems, vol.1, issue.1, pp.26-66, 2006.
DOI : 10.1145/1152934.1152937

J. Banâtre, Y. Radenac, and P. Fradet, Chemical specification of autonomic systems, In IASSE, pp.72-79, 2004.

M. Bertier, M. Obrovac, and C. Tedeschi, Adaptive atomic capture of multiple molecules, Journal of Parallel and Distributed Computing, vol.73, issue.9, pp.1251-1266, 2013.
DOI : 10.1016/j.jpdc.2013.03.010
URL : https://hal.archives-ouvertes.fr/hal-00915220

D. Conte, P. Foggia, C. Sansone, and M. Vento, THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION, International Journal of Pattern Recognition and Artificial Intelligence, vol.18, issue.03, pp.265-298, 2004.
DOI : 10.1142/S0218001404003228
URL : https://hal.archives-ouvertes.fr/hal-01408706

P. Dittrich, J. Ziegler, and W. Banzhaf, Artificial Chemistries???A Review, Artificial Life, vol.17, issue.3, pp.225-275, 2001.
DOI : 10.1162/106454601753138998

A. Doniec, S. Piechowiak, and R. Mandiau, A discsp solving algorithm based on sessions, FLAIRS Conference, pp.666-670, 2005.

K. Gladitz and H. Kuchen, Shared Memory Implementation of the Gamma-Operation, Journal of Symbolic Computation, vol.21, issue.4-6, pp.577-591, 1996.
DOI : 10.1006/jsco.1996.0032

S. Grumbach and F. Wang, Netlog, a Rule-Based Language for Distributed Programming, Lecture Notes in Computer Science, vol.5937, pp.88-103, 2010.
DOI : 10.1007/978-3-642-11503-5_9

S. Hariri and M. Parashar, Handbookf of Bioinspired Algorithms and Applications, chapter The Foundations of Autonomic Computing, 2005.

B. Ismel and M. Pedro, Synchronous, asynchronous and hybrid algorithms for DisCSP, Principles and Practice of Constraint Programming, 2004.

J. Larrosa and G. Valiente, Constraint satisfaction algorithms for graph pattern matching, Mathematical Structures in Computer Science, vol.12, issue.04, pp.403-422, 2002.
DOI : 10.1017/S0960129501003577

B. T. Messmer and H. Bunke, Subgraph isomorphism in polynomial time, Neubruckstr, vol.10, 1995.

A. Mostéfaoui, Towards a Computing Model for Open Distributed Systems, PaCT, pp.74-79, 2007.
DOI : 10.1007/978-3-540-73940-1_7

M. Obrovac and C. Tedeschi, On the Feasibility of a Distributed Runtime for the Chemical Programming Model, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012.
DOI : 10.1109/IPDPSW.2012.95
URL : https://hal.archives-ouvertes.fr/hal-00716114

M. Parashar and S. Hariri, Autonomic Computing: An Overview, International Workshop on Unconventional Programming Paradigms, pp.257-269, 2004.
DOI : 10.1007/11527800_20

J. R. Ullmann, An Algorithm for Subgraph Isomorphism, Journal of the ACM, vol.23, issue.1, pp.31-42, 1976.
DOI : 10.1145/321921.321925

M. Viroli and F. Zambonelli, A biochemical approach to adaptive service ecosystems, Information Sciences, vol.180, issue.10, 2009.
DOI : 10.1016/j.ins.2009.11.021

R. Zivan and A. Meisels, Parallel backtrack search on discsp, 2002.

R. Zivan and A. Meisels, Message delay and DisCSP search algorithms, Annals of Mathematics and Artificial Intelligence, vol.170, issue.1???2, pp.415-439, 2006.
DOI : 10.1007/s10472-006-9033-2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.180.9194