L. M. Adleman, Molecular computation of solutions to combinatorial problems, Science, vol.266, issue.5187, p.1021, 1994.
DOI : 10.1126/science.7973651

D. Angluin, J. Aspnes, M. Chan, M. J. Fischer, H. Jiang et al., Stably Computable Properties of Network Graphs, DCOSS, pp.63-74, 2005.
DOI : 10.1007/11502593_8

D. Angluin, J. Aspnes, Z. Diamadi, M. J. Fischer, and R. Peralta, Computation in networks of passively mobile finite-state sensors, PODC, pp.290-299, 2004.

D. Angluin, J. Aspnes, and D. Eisenstat, Stably computable predicates are semilinear, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.292-299, 2006.
DOI : 10.1145/1146381.1146425

D. Angluin, J. Aspnes, D. Eisenstat, and E. Ruppert, The computational power of population protocols, Distributed Computing, vol.34, issue.3, pp.279-304, 2007.
DOI : 10.1007/s00446-007-0040-2

D. Angluin, J. Aspnes, M. J. Fischer, and H. Jiang, Self-stabilizing population protocols, OPODIS, LNCS, pp.79-90, 2005.
DOI : 10.1007/11795490_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.589

D. Angluin, J. Aspnes, and D. Eisenstat, Fast computation by population protocols with a leader, Distributed Computing, pp.183-199, 2008.

D. Angluin, J. Aspnes, and D. Eisenstat, A simple population protocol for fast robust approximate majority, Distributed Computing, pp.87-102, 2008.

J. Aspnes and E. Ruppert, An Introduction to Population Protocols, Bulletin of the EATCS, vol.93, pp.106-125, 2007.
DOI : 10.1007/978-3-540-89707-1_5

G. Aupy and O. Bournez, On the number of binary-minded individuals required to compute 1/2, Theoretical Computer Science, vol.412, issue.22, pp.2219-2456, 2010.

G. Berry, The chemical abstract machine, Theoretical Computer Science, vol.96, issue.1, pp.217-248, 1992.
DOI : 10.1016/0304-3975(92)90185-I
URL : https://hal.archives-ouvertes.fr/inria-00075426

V. Blondel, J. Hendrickx, A. Olshevsky, and J. Tsitsiklis, Convergence in Multiagent Coordination, Consensus, and Flocking, Proceedings of the 44th IEEE Conference on Decision and Control, pp.2996-3000, 2005.
DOI : 10.1109/CDC.2005.1582620

O. Bournez, J. Chalopin, J. Cohen, X. Koegler, and M. Rabie, Computing with Pavlovian Populations, OPODIS, pp.409-420, 2011.
DOI : 10.1007/978-3-642-25873-2_28
URL : https://hal.archives-ouvertes.fr/hal-00760778

O. Bournez, P. Chassaing, J. Cohen, X. Gerin, and . Koegler, On the convergence of population protocols when population goes to infinity, Applied Mathematics and Computation, vol.215, issue.4, 2009.
DOI : 10.1016/j.amc.2009.04.056
URL : https://hal.archives-ouvertes.fr/inria-00432318

A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass et al., Impact of Human Mobility on Opportunistic Forwarding Algorithms, IEEE Transactions on Mobile Computing, vol.6, issue.6, pp.606-620, 2007.
DOI : 10.1109/TMC.2007.1060

I. Chatzigiannakis, O. Michail, and P. G. Spirakis, Algorithmic Verification of Population Protocols, SSS, pp.221-235, 2010.
DOI : 10.1007/978-3-642-16023-3_19

I. Chatzigiannakis and P. G. Spirakis, The Dynamics of Probabilistic Population Protocols, DISC, pp.498-499, 2008.
DOI : 10.1007/978-3-540-87779-0_35

B. Chazelle, Natural Algorithms, SODA, pp.422-431, 2009.
DOI : 10.1137/1.9781611973068.47

J. Clément, C. Delporte-gallet, H. Fauconnier, and M. Sighireanu, Guidelines for the Verification of Population Protocols, 2011 31st International Conference on Distributed Computing Systems, pp.215-224, 2011.
DOI : 10.1109/ICDCS.2011.36

F. Cucker and S. Smale, Emergent Behavior in Flocks, IEEE Transactions on Automatic Control, vol.52, issue.5, pp.852-862, 2007.
DOI : 10.1109/TAC.2007.895842

C. Delporte-gallet, H. Fauconnier, R. Guerraoui, and E. Ruppert, When Birds Die: Making Population Protocols Fault-Tolerant, DCOSS, pp.51-66, 2006.
DOI : 10.1007/11776178_4
URL : https://hal.archives-ouvertes.fr/hal-00154871

A. Fernández, V. Gramoli, E. Jiménez, A. Kermarrec, and M. , Distributed Slicing in Dynamic Systems, 27th International Conference on Distributed Computing Systems (ICDCS '07), 2007.
DOI : 10.1109/ICDCS.2007.102

V. Gramoli, Y. Vigfusson, K. Birman, A. Kermarrec, and R. Van-renesse, Slicing Distributed Systems, IEEE Transactions on Computers, vol.58, issue.11, pp.581444-1455, 2009.
DOI : 10.1109/TC.2009.111
URL : https://hal.archives-ouvertes.fr/inria-00435175

I. Gupta, M. Nagda, and C. F. Devaraj, The design of novel distributed protocols from differential equations, Distributed Computing, pp.95-114, 2007.
DOI : 10.1007/s00446-007-0024-2

M. W. Hirsch, S. Smale, and R. Devaney, Differential Equations, Dynamical Systems , and an Introduction to Chaos, 2003.

J. Hofbauer and K. Sigmund, Evolutionary game dynamics, Bulletin of the American Mathematical Society, vol.40, issue.04, pp.479-519, 2003.
DOI : 10.1090/S0273-0979-03-00988-1

P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft et al., Pocket switched networks and human mobility in conference environments, Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking , WDTN '05, pp.244-251, 2005.
DOI : 10.1145/1080139.1080142

M. Jelasity and A. Kermarrec, Ordered Slicing of Very Large-Scale Overlay Networks, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06), pp.117-124, 2006.
DOI : 10.1109/P2P.2006.25

P. Juang, H. Oki, Y. Wang, M. Martonosi, L. Shiuan-peh et al., Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet, ASPLOS, pp.96-107, 2002.

O. Michail, I. Chatzigiannakis, and P. G. Spirakis, Mediated population protocols, Theoretical Computer Science, vol.412, issue.22, pp.2434-2450, 2011.
DOI : 10.1016/j.tcs.2011.02.003

J. D. Murray, Mathematical Biology. I: An Introduction, 2002.

Y. Wang, S. Jain, M. Martonosi, and K. Fall, Erasure-coding based routing for opportunistic networks, Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking , WDTN '05, pp.229-236, 2005.
DOI : 10.1145/1080139.1080140