.. Execution-of-higher-order-programs, 132 5.3.1 Execution of Rules, p.134

S. Abiteboul, M. Bienvenu, A. Galland, and E. Antoine, A rule-based language for web data management, Proceedings of the 30th symposium on Principles of database systems of data, PODS '11, pp.293-304, 2011.
DOI : 10.1145/1989284.1989320

URL : https://hal.archives-ouvertes.fr/inria-00582891

D. Agrawal and A. Abbadi, Efficient solution to the distributed mutual exclusion problem, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing , PODC '89, pp.193-200, 1989.
DOI : 10.1145/72981.72994

A. Andrzejak and Z. Xu, Scalable, efficient range queries for grid information services, Proceedings. Second International Conference on Peer-to-Peer Computing,, pp.33-40, 2002.
DOI : 10.1109/PTP.2002.1046310

F. Araújo and L. Rodrigues, Survey on distributed hash tables, p.29, 2006.

T. Asano, D. Ranjan, T. Roos, E. Welzl, and P. Widmayer, Space-filling curves and their use in the design of geometric data structures, Theoretical Computer Science, vol.181, issue.1, pp.3-15, 1997.
DOI : 10.1016/S0304-3975(96)00259-9

J. Aspnes and E. Ruppert, An introduction to population protocols. Bulletin of the European Association for Theoretical Computer Science, pp.98-117, 2007.

J. Aspnes and G. Shah, Skip graphs, ACM Transactions on Algorithms, vol.3, issue.4, pp.37-37, 2007.
DOI : 10.1145/1290672.1290674

R. Baldoni, An O(N/sup M/(M+1/)) distributed algorithm for the k-out of-M resources allocation problem, 14th International Conference on Distributed Computing Systems, pp.81-88, 1994.
DOI : 10.1109/ICDCS.1994.302396

J. Banâtre, A. Coutant, and D. L. Métayer, A parallel machine for multiset transformation and its programming style, Future Generation Computer Systems, vol.4, issue.2, pp.133-144, 1988.
DOI : 10.1016/0167-739X(88)90012-X

J. Banâtre, P. Fradet, and Y. Radenac, Higher-Order Chemical Programming Style, Proceedings of the Workshop on Unconventional Programming, pp.84-95, 2005.
DOI : 10.1007/11527800_7

J. Banâtre, P. Fradet, and Y. Radenac, Towards chemical coordination for grids, Proceedings of the 2006 ACM symposium on Applied computing , SAC '06, 2006.
DOI : 10.1145/1141277.1141381

J. Banâtre and T. Priol, Chemical Programming of Future Service-oriented Architectures, Journal of Software, vol.4, issue.7, p.174, 2009.
DOI : 10.4304/jsw.4.7.738-746

Y. Bar-yam, Dynamics of Complex Systems (Studies in Nonlinearity), Computers in Physics, vol.12, issue.4, 2002.
DOI : 10.1063/1.4822633

P. A. Bernstein and N. Goodman, Concurrency Control in Distributed Database Systems, ACM Computing Surveys, vol.13, issue.2, pp.185-221, 1981.
DOI : 10.1145/356842.356846

A. R. Bharambe, M. Agrawal, and S. Seshan, Mercury, ACM SIGCOMM Computer Communication Review, vol.34, issue.4, pp.353-366, 2004.
DOI : 10.1145/1030194.1015507

R. Bolze, F. Cappello, E. Caron, M. Daydé, F. Desprez et al., Grid'5000: A Large Scale And Highly Reconfigurable Experimental Grid Testbed, International Journal of High Performance Computing Applications, vol.20, issue.4, pp.481-494, 2006.
DOI : 10.1177/1094342006070078

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

M. Cai, M. Frank, J. Chen, and P. Szekely, MAAN: A Multi-Attribute Addressable Network for Grid Information Services, Journal of Grid Computing, vol.2, issue.1, pp.3-14, 2004.
DOI : 10.1007/s10723-004-1184-y

K. S. Candan, J. Tatemura, D. Agrawal, and D. Cavendish, On Overlay Schemes to Support Point-in-range Queries for Scalable Grid Resource Discovery, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05), p.129, 2005.

J. Cardoso, A. Barros, N. May, and U. Kylau, Towards a Unified Service Description Language for the Internet of Services: Requirements and First Developments, 2010 IEEE International Conference on Services Computing, pp.602-609, 2010.
DOI : 10.1109/SCC.2010.93

J. B. Carter, J. K. Bennett, and W. Zwaenepoel, Implementation and Performance of Munin, Proceedings of the thirteenth ACM symposium on Operating systems principles, pp.164-68, 1991.

O. S. Carvalho and G. , On mutual exclusion in computer networks, Communications of the ACM, vol.26, issue.2, pp.146-147, 1983.

M. Castro, P. Druschel, A. Kermarrec, and A. Rowstron, Scribe: a large-scale and decentralized application-level multicast infrastructure, IEEE Journal on Selected Areas in Communications, vol.20, issue.8, p.71, 2002.
DOI : 10.1109/JSAC.2002.803069

T. D. Chandra, V. Hadzilacos, and S. Toueg, The weakest failure detector for solving consensus, Journal of the ACM, vol.43, issue.4, pp.685-722, 1996.
DOI : 10.1145/234533.234549

K. M. Chandy and J. Misra, The drinking philosophers problem, ACM Transactions on Programming Languages and Systems, vol.6, issue.4, pp.632-646, 1984.
DOI : 10.1145/1780.1804

B. Chazelle, Computational Geometry on a Systolic Chip, IEEE Transactions on Computers, vol.33, issue.9, pp.774-785, 1984.
DOI : 10.1109/TC.1984.1676494

S. Y. Cheung, M. Ahamad, and M. H. Ammar, Multidimensional voting: a general method for implementing synchronization in distributed systems, Proceedings.,10th International Conference on Distributed Computing Systems, pp.362-369, 1990.
DOI : 10.1109/ICDCS.1990.89304

A. Datta, M. Hauswirth, R. John, R. Schmidt, and K. Aberer, Range queries in triestructured overlays, Fifth IEEE International Conference on Peer-to-Peer Computing, pp.57-66, 2005.

N. G. De-bruijn and P. Erdos, A combinatorial problem Koninklijke Netherlands: Academe Van Wetenschappen, pp.758-764, 1946.

C. , D. Napoli, M. Giordano, J. Pazat, and C. Wang, A Chemical Based Middleware for Workflow Instantiation and Execution, ServiceWave, pp.100-111, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00714547

E. W. Dijkstra, Hierarchical ordering of sequential processes, Acta Informatica, vol.1, issue.2, pp.115-138, 1971.
DOI : 10.1007/BF00289519

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

S. Dobson, R. Sterritt, P. Nixon, and M. Hinchey, Fulfilling the Vision of Autonomic Computing, Computer, vol.43, issue.1, pp.35-41, 2010.
DOI : 10.1109/MC.2010.14

S. Dolev, Self Stabilization, Journal of Aerospace Computing, Information, and Communication, vol.1, issue.6, p.157, 2000.
DOI : 10.2514/1.10141

URL : https://hal.archives-ouvertes.fr/inria-00627780

D. Eastlake and P. Jones, Us secure hash algorithm 1 (sha1), p.33, 2001.
DOI : 10.17487/rfc3174

H. Fernández, Flexible Coordination through the Chemical Metaphor for Service Infrastructures, p.158, 2012.

H. Fernández, T. Priol, and C. Tedeschi, Decentralized Approach for Execution of Composite Web Services Using the Chemical Paradigm, 2010 IEEE International Conference on Web Services, p.184, 2010.
DOI : 10.1109/ICWS.2010.46

M. J. Fischer, N. A. Lynch, J. E. Burns, and A. Borodin, Resource allocation with immunity to limited process failure, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pp.234-254, 1979.
DOI : 10.1109/SFCS.1979.37

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.666

P. Fraigniaud and P. Gauron, D2B: A de Bruijn based content-addressable network, Theoretical Computer Science, vol.355, issue.1, pp.65-79, 2006.
DOI : 10.1016/j.tcs.2005.12.006

P. Ganesan, M. Bawa, and H. Garcia-molina, Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems, Proceedings of the Thirtieth international conference on Very large data bases, pp.444-455, 2004.
DOI : 10.1016/B978-012088469-8.50041-3

J. Gao and P. Steenkiste, An adaptive protocol for efficient support of range queries in dht-based systems, 12th IEEE International Conference on Network Protocols, pp.239-250, 2004.

H. Garcia-molina and D. Barbara, How to assign votes in a distributed system, Journal of the ACM, vol.32, issue.4, pp.841-860, 1985.
DOI : 10.1145/4221.4223

M. R. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of np-completeness, p.28, 1979.

I. Gelado, J. E. Stone, J. Cabezas, S. Patel, N. Navarro et al., An asymmetric distributed shared memory model for heterogeneous parallel systems, ACM SIGPLAN Notices, vol.45, issue.3, pp.347-358, 2010.
DOI : 10.1145/1735971.1736059

D. K. Gifford, Weighted voting for replicated data, Proceedings of the seventh symposium on Operating systems principles , SOSP '79, pp.150-162, 1979.
DOI : 10.1145/800215.806583

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, 12th International Symposium on Practical Aspects of Declarative Languages, pp.88-103, 2010.
DOI : 10.1007/978-3-642-11503-5_9

K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker et al., The impact of DHT routing geometry on resilience and proximity, Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications , SIGCOMM '03, pp.381-394, 2003.
DOI : 10.1145/863955.863998

C. Hankin, D. L. Métayer, and D. Sands, A Parallel programming style and its algebra of programs, Parallel Architectures and Languages Europe (PARLE), pp.367-378, 1993.
DOI : 10.1007/3-540-56891-3_29

N. J. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman, Skipnet: A scalable overlay network with practical locality properties, Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems, pp.9-9, 2003.

P. Horn, Autonomic computing: Ibm's perspective on the state of information technology, 2001.

L. Huang, W. Tong, W. N. Kam, and Y. Sun, Implementation of GAMMA on a massively parallel computer, Journal of Computer Science and Technology, vol.6, issue.3, pp.29-39
DOI : 10.1007/BF02943142

P. Inverardi and A. L. Wolf, Formal specification and analysis of software architectures using the chemical abstract machine model, IEEE Transactions on Software Engineering, vol.21, issue.4, 1995.
DOI : 10.1109/32.385973

Y. Jégou, Dynamic Memory Management on Mome DSM. Cluster Computing, p.68, 2006.

M. Jelasity, S. Voulgaris, R. Guerraoui, A. Kermarrec, and M. Van-steen, Gossip-based peer sampling, ACM Transactions on Computer Systems, vol.25, issue.3, pp.8-158, 2007.
DOI : 10.1145/1275517.1275520

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.501

Y. J. Joung, Asynchronous group mutual exclusion. Distributed Computing, pp.189-206, 2000.

M. Kaashoek and D. Karger, Koorde: A simple degree-optimal distributed hash table. Peer-to-Peer Systems II, pp.98-107, 2003.

H. Kakugawa, S. Fujita, M. Yamashita, and T. Ae, Availability of k-coterie, IEEE Transactions on Computers, vol.42, issue.5, pp.553-558, 1993.
DOI : 10.1109/12.223674

H. Kakugawa, S. Fujita, M. Yamashita, and T. Ae, A distributed k-mutual exclusion algorithm using k-coterie, Information Processing Letters, vol.49, issue.4, pp.213-218, 1994.
DOI : 10.1016/0020-0190(94)90014-0

D. Karger, E. Lehman, T. Leighton, R. Panigrahy, M. Levine et al., Consistent hashing and random trees, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.654-663, 1997.
DOI : 10.1145/258533.258660

J. R. Karr, J. C. Sanghvi, D. N. Macklin, M. V. Gutschow, J. M. Jacobs et al., A Whole-Cell Computational Model Predicts Phenotype from Genotype, Cell, vol.150, issue.2, pp.389-401, 2012.
DOI : 10.1016/j.cell.2012.05.044

J. O. Kephart and D. M. Chess, The vision of autonomic computing, Computer, vol.36, issue.1, pp.41-50, 2003.
DOI : 10.1109/MC.2003.1160055

D. E. Knuth, The art of computer programming, p.53, 2006.

A. Kumar, Hierarchical quorum consensus: a new algorithm for managing replicated data, IEEE Transactions on Computers, vol.40, issue.9, pp.996-1004, 1991.
DOI : 10.1109/12.83661

Z. Laliwala, R. Khosla, P. Majumdar, and S. Chaudhary, Semantic and Rules Based Event-Driven Dynamic Web Services Composition for Automation of Business Processes, 2006 IEEE Services Computing Workshops, pp.175-182, 2006.
DOI : 10.1109/SCW.2006.38

L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, issue.7, pp.558-565, 1978.
DOI : 10.1145/359545.359563

B. Lampson and H. Sturgis, Crash recovery in a distributed data storage system. Xerox Palo Alto Research Center, p.179, 1979.

P. Langendoerfer, K. Piotrowski, M. Diaz, and B. Rubio, Distributed Shared Memory as an Approach for Integrating WSNs and Cloud Computing, 2012 5th International Conference on New Technologies, Mobility and Security (NTMS), pp.1-6, 2012.
DOI : 10.1109/NTMS.2012.6208723

L. Métayer, Describing software architecture styles using graph grammars, IEEE Transactions on Software Engineering, vol.24, issue.7, 1998.
DOI : 10.1109/32.708567

A. Lèbre, R. Lottiaux, E. Focht, and C. Morin, Reducing Kernel Development Complexity in Distributed Environments, Euro-Par, pp.576-586, 2008.
DOI : 10.1007/978-3-540-85451-7_61

H. Lin, J. Kemp, and P. Gilbert, Computing Gamma Calculus on Computer Cluster, International Journal of Technology Diffusion, vol.1, issue.4, pp.42-52, 2010.
DOI : 10.4018/jtd.2010100104

J. W. Lloyd, Practical Advtanages of Declarative Programming, Joint Conference on Declarative Programming (GULP-PRODE'94), pp.18-30, 1994.

E. K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, A survey and comparison of peer-to-peer overlay network schemes, IEEE Communications Surveys & Tutorials, vol.29, pp.72-93, 2005.

N. Lynch, D. Malkhi, and D. Ratajczak, Atomic Data Access in Distributed Hash Tables, pp.295-305, 2002.
DOI : 10.1007/3-540-45748-8_28

M. Maekawa, A N algorithm for mutual exclusion in decentralized systems, ACM Transactions on Computer Systems, vol.3, issue.2, pp.145-159, 1985.
DOI : 10.1145/214438.214445

D. Malkhi, M. Naor, and D. Ratajczak, Viceroy, Proceedings of the twenty-first annual symposium on Principles of distributed computing , PODC '02, pp.183-192, 2002.
DOI : 10.1145/571825.571857

Y. Manabe, R. Baldoni, M. Raynal, and S. Aoyagi, k-Arbiter: A safe and general scheme for h-out of-k mutual exclusion, Theoretical Computer Science, vol.193, issue.1-2, pp.97-112, 1998.
DOI : 10.1016/S0304-3975(97)00303-4

URL : https://hal.archives-ouvertes.fr/inria-00074154

Y. Manabe and N. Tajima, (h,k)-Arbiters for h-out-of-k mutual exclusion problem, Theoretical Computer Science, vol.310, issue.1-3, pp.379-392, 2004.
DOI : 10.1016/j.tcs.2003.08.003

P. Maymounkov and D. Mazieres, Kademlia: A peer-to-peer information system based on the xor metric. Peer-to-Peer Systems, pp.53-65, 2002.

D. Mccarthy and U. Dayal, The architecture of an active database management system, ACM SIGMOD Record, vol.18, issue.2, pp.215-224, 1989.
DOI : 10.1145/66926.66946

H. Mcevoy, GAMMA, CHROMATIC TYPING AND VEGETATION, 1996.
DOI : 10.1142/9781848161023_0015

D. Mentré, D. L. Métayer, and T. Priol, Formalization and verification of coherence protocols with the gamma framework, Proceedings International Symposium on Software Engineering for Parallel and Distributed Systems PDSE-99, 2000.
DOI : 10.1109/PDSE.2000.847855

D. S. Milojicic, V. Kalogeraki, R. Lukose, K. Nagaraja, J. Pruyne et al., Peer-to-peer computing, p.29, 2002.

M. Mizuno, M. L. Neilsen, and R. Rao, A token based distributed mutual exclusion algorithm based on quorum agreements, [1991] Proceedings. 11th International Conference on Distributed Computing Systems, pp.361-368, 1991.
DOI : 10.1109/ICDCS.1991.148690

A. Mostéfaoui, Towards a Computing Model for Open Distributed Systems, 9th International Conference on Parallel Computing Technologies (PaCT), pp.74-79, 2007.
DOI : 10.1007/978-3-540-73940-1_7

M. Naimi and M. Trehel, How to detect a failure and regenerate the token in the log (n) distributed algorithm for mutual exclusion. Distributed Algorithms, pp.155-166, 1988.

M. L. Neilsen and M. Mizuno, A DAG-based algorithm for distributed mutual exclusion, [1991] Proceedings. 11th International Conference on Distributed Computing Systems, pp.354-360, 1991.
DOI : 10.1109/ICDCS.1991.148689

M. L. Neilsen, M. Mizuno, and M. , A general method to define quorums, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems, pp.657-664, 1992.
DOI : 10.1109/ICDCS.1992.235110

URL : https://hal.archives-ouvertes.fr/inria-00075033

Z. Németh, C. Pérez, and T. Priol, Distributed workflow coordination: molecules and reactions, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006.
DOI : 10.1109/IPDPS.2006.1639517

S. Nishio, K. F. Li, and E. G. Manning, A resilient mutual exclusion algorithm for computer networks. Parallel and Distributed Systems, IEEE Transactions on, vol.1, issue.3, pp.344-355, 1990.

M. Parashar and S. Hariri, Autonomic computing: An overview. Unconventional Programming Paradigms, pp.97-97, 2005.

C. G. Plaxton, R. Rajaraman, and A. W. Richa, Accessing nearby copies of replicated objects in a distributed environment, Theory of Computing Systems, pp.241-280, 1999.

J. Protic, M. Tomasevic, and V. Milutinovic, Distributed shared memory: concepts and systems. Parallel Distributed Technology: Systems Applications, IEEE, vol.4, issue.2, pp.63-71, 1996.

Y. Radenac, Programmation " chimique " d'ordre supérieur, pp.49-158, 2007.

S. Ramabhadran, S. Ratnasamy, J. M. Hellerstein, and S. Shenker, Prefix hash tree: An indexing data structure over distributed hash tables, Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing, p.37, 2004.

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable contentaddressable network, Proceedings of the 2001 conference on Applications, technologies , architectures, and protocols for computer communications, pp.161-172, 2001.

K. Raymond, A distributed algorithm for multiple entries to a critical section, Information Processing Letters, vol.30, issue.4, pp.189-193, 1989.
DOI : 10.1016/0020-0190(89)90211-1

K. Raymond, A tree-based algorithm for distributed mutual exclusion, ACM Transactions on Computer Systems, vol.7, issue.1, pp.61-77, 1989.
DOI : 10.1145/58564.59295

G. Ricart and A. K. Agrawala, An optimal algorithm for mutual exclusion in computer networks, Communications of the ACM, vol.24, issue.1, pp.9-17, 1981.
DOI : 10.1145/358527.358537

G. Ricart and A. K. Agrawala, Authors' response to "on mutual exclusion in computer networks, Commun. ACM, vol.26, issue.2, pp.147-148, 1983.

L. Rilling and C. Morin, A practical transparent data sharing service for the grid, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005., pp.897-904, 2005.
DOI : 10.1109/CCGRID.2005.1558657

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

A. Rowstron and P. Druschel, Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, Middleware 2001, pp.329-350, 2001.
DOI : 10.1007/3-540-45518-3_18

B. A. Sanders, The information structure of distributed mutual exclusion algorithms, ACM Transactions on Computer Systems, vol.5, issue.3, pp.284-299, 1987.
DOI : 10.1145/24068.28052

C. Schmidt and M. Parashar, Squid: Enabling search in DHT-based systems, Journal of Parallel and Distributed Computing, vol.68, issue.7, pp.962-975, 2008.
DOI : 10.1016/j.jpdc.2008.02.003

F. B. Schneider, Implementing fault-tolerant services using the state machine approach: a tutorial, ACM Computing Surveys, vol.22, issue.4, pp.71-156, 1990.
DOI : 10.1145/98163.98167

H. J. Siegel, Interconnection Networks for SIMD Machines, Computer, vol.12, issue.6, pp.57-65, 1979.
DOI : 10.1109/MC.1979.1658780

A. Silberschatz, P. B. Galvin, G. Gagne, and A. Silberschatz, Operating system concepts, p.39, 1998.

M. Singhal, A heuristically-aided algorithm for mutual exclusion in distributed systems, IEEE Transactions on Computers, vol.38, issue.5, pp.651-662, 1989.
DOI : 10.1109/12.24268

D. Skeen and M. Stonebraker, A Formal Model of Crash Recovery in a Distributed System, IEEE Transactions on Software Engineering, vol.9, issue.3, pp.95-184, 1983.
DOI : 10.1109/TSE.1983.236608

P. K. Srimani and R. L. Reddy, Another distributed algorithm for multiple entries to a critical section, Information Processing Letters, vol.41, issue.1, pp.51-57, 1992.
DOI : 10.1016/0020-0190(92)90079-B

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, Chord, ACM SIGCOMM Computer Communication Review, vol.31, issue.4, pp.149-160, 2001.
DOI : 10.1145/964723.383071

H. Sullivan and T. R. Bashkow, A large scale, homogeneous, fully distributed parallel machine, ACM SIGARCH Computer Architecture News, pp.105-117, 1977.

I. Suzuki and T. Kasami, A distributed mutual exclusion algorithm, ACM Transactions on Computer Systems, vol.3, issue.4, pp.344-349, 1985.
DOI : 10.1145/6110.214406

R. H. Thomas, A Majority consensus approach to concurrency control for multiple copy databases, ACM Transactions on Database Systems, vol.4, issue.2, pp.180-209, 1979.
DOI : 10.1145/320071.320076

M. Tsangou, S. Ndiaye, M. Seck, and W. Litwin, Range queries to scalable distributed data structure rp*, Proc. Fifth Workshop on Distributed Data and Structures, WDAS, p.37, 2003.

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

Y. Wang, M. Li, J. Cao, F. Tang, L. Chen et al., An ECA-Rule-Based Workflow Management Approach for Web Services Composition, 4th International Conference on Grid and Cooperative Computing, pp.143-148, 2005.
DOI : 10.1007/11590354_19

K. A. Wong, Jasmine: A shared-object multi-locking distributed shared memory system for heterogeneous computers, p.65, 2004.

Z. Xu and Z. Zhang, Building low-maintenance expressways for p2p systems. Hewlett-Packard Labs, p.36, 2002.

B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph et al., Tapestry: A Resilient Global-Scale Overlay for Service Deployment, IEEE Journal on Selected Areas in Communications, vol.22, issue.1, pp.41-53, 2004.
DOI : 10.1109/JSAC.2003.818784

M. Bertier, M. Obrovac, and C. Tedeschi, Adaptive atomic capture of multiple molecules, Journal of Parallel and Distributed Computing, vol.73, issue.9, p.2013
DOI : 10.1016/j.jpdc.2013.03.010

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

M. Obrovac and C. Tedeschi, Experimental Evaluation of a Hierarchical Chemical Computing Platform, International Journal of Networking and Computing, vol.3, issue.1, 2013.
DOI : 10.15803/ijnc.3.1_37

M. Obrovac and C. Tedeschi, Distributed Chemical Computing: A Feasibility Study, International Journal of Unconventional Computing (IJUC), p.2012
URL : https://hal.archives-ouvertes.fr/hal-00716124

F. Fernández, M. Obrovac, and C. Tedeschi, Towards Decentralised Workflow Scheduling via a Rule-Driven Shared Space, International Conferences [ 13 th International IFIP Conference on Distributed Applications and Interoperable Systems (DAIS). Short paper, 2013.
DOI : 10.1007/978-3-642-38541-4_16

M. Obrovac and C. Tedeschi, Deployment and Evaluation of a Decentralised Runtime for Concurrent Rule-Based Programming Models, 14 th International Conference on Distributed Computing and Networking (ICDCN), 2013.
DOI : 10.1007/978-3-642-35668-1_28

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

M. Bertier, M. Obrovac, and C. Tedeschi, A Protocol for the Atomic Capture of Multiple Molecules on Large Scale Platforms, 13 th International Conference on Distributed Computing and Networking (ICDCN), 2012.
DOI : 10.1007/3-540-54029-6_209

M. Obrovac and C. Tedeschi, When Distributed Hash Tables Meet Chemical Programming for Autonomic Computing, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012.
DOI : 10.1109/IPDPSW.2012.73

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

H. Fernández, M. Obrovac, and C. Tedeschi, Decentralised Multiple Workflow Scheduling via a Chemically-coordinated Shared Space, 2012.

M. Obrovac and C. Tedeschi, On Distributing the Runtime of the Chemical Programming Model, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00604134