¨. O. 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, P. Fradet, and Y. Radenac, Principles of Chemical Programming, Principles of Chemical Programming Proceedings of the 5th International Workshop on Rule-Based Programming, pp.133-147, 2004.
DOI : 10.1016/j.entcs.2004.07.019

J. Banâtre, P. Fradet, and Y. Radenac, Generalised multisets for chemical programming, Mathematical Structures in Computer Science, vol.16, issue.04, pp.557-580, 2006.
DOI : 10.1017/S0960129506005317

J. Banâtre, Y. Radenac, and P. Fradet, Chemical specification of autonomic systems, ISCA 13th International Conference on Intelligent and Adaptive Systems and Software Engineering, pp.72-79, 2004.

G. Berry and G. Boudol, The chemical abstract machine, Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '90, pp.81-94, 1990.
URL : https://hal.archives-ouvertes.fr/inria-00075426

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

M. Bertier, M. Perrin, and C. Tedeschi, On the Complexity of Concurrent Multiset Rewriting, International Journal of Foundations of Computer Science, vol.27, issue.01, p.8408, 2013.
DOI : 10.1142/S0129054116500052

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

I. Brito, Synchronous, Asynchronous and Hybrid Algorithms for DisCSP, Lecture Notes in Computer Science, vol.3258, pp.791-791, 2004.
DOI : 10.1007/978-3-540-30201-8_70

G. Ciobanu, R. Desai, and A. Kumar, Membrane systems and distributed computing, International Workshop on Membrane Computing, pp.187-202, 2002.

D. Cohen and J. M. Filho, Introducing a calculus for higher-order multiset programming, Proceedings of the First International Conference on Coordination Languages and Models, COORDINATION '96, pp.124-141, 1996.
DOI : 10.1007/3-540-61052-9_43

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 ses- On the Complexity of Concurrent Multiset Rewriting 17

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, Peña Lecture Notes in Computer Science, vol.5937, pp.88-103, 2010.
DOI : 10.1007/978-3-642-11503-5_9

C. Hankin, D. L. Métayer, and D. Sands, A Parallel programming style and its algebra of programs, Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe, PARLE '93, pp.367-378, 1993.
DOI : 10.1007/3-540-56891-3_29

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

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, tech. rep, Institut fur Informatik und angewandte Mathematik, 1995.

A. Mostéfaoui, Towards a Computing Model for Open Distributed Systems, E. Malyshkin Lecture Notes in Computer Science, vol.4671, pp.74-79, 2007.
DOI : 10.1007/978-3-540-73940-1_7

M. Obrovac and C. Tedeschi, Distributed chemical computing: A feasibility study, International Journal of Unconventional Computing, vol.9, issue.3-4, pp.203-236, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00716124

M. Parashar and S. Hariri, Autonomic Computing: An Overview, International Workshop on Unconventional Programming Paradigms, LNCS, vol.3566, pp.257-269, 2004.

G. Paun, G. Rozenberg, and A. Salomaa, The Oxford Handbook of Membrane Computing, 2010.

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, pp.1876-1892, 2010.
DOI : 10.1016/j.ins.2009.11.021

R. Zivan and A. Meisels, Parallel backtrack search on discsp, Distributed Constraint Reasoning (DCR-02), 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