Mediated population protocols

Theoretical Computer Science

Volumn 412, Issue 22, 2011, Pages 2434-2450

  Michail, Othon ^a   Chatzigiannakis, Ioannis ^a   Spirakis, Paul G ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

Diffuse computation; Finite state agent; Intermittent communication; Passive mobility; Population protocol; Stable computation

Indexed keywords

DIFFUSE COMPUTATION; FINITE-STATE; INTERMITTENT COMMUNICATION; PASSIVE MOBILITY; POPULATION PROTOCOL; STABLE COMPUTATION;

MOBILE AGENTS;

EID: 79953300467     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.02.003     Document Type: Article

References (33)

1. D. Angluin, J. Aspnes, M. Chan, M.J. Fischer, H. Jiang, and R. Peralta Stably computable properties of network graphs V.K. Prasanna, S. Iyengar, P. Spirakis, M. Welsh, Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USE, June/July, 2005, Proceedings Lecture Notes in Computer Science vol. 3560 2005 Springer-Verlag 63 74 (Pubitemid 41425109)
2. D. Angluin, J. Aspnes, Z. Diamadi, M.J. Fischer, and R. Peralta Computation in networks of passively mobile finite-state sensors PODC'04: Proceedings of the Twenty-third Annual ACM Symposium on Principles of Distributed Computing 2004 ACM New York, NY, USA 290 299
3. D. Angluin, J. Aspnes, Z. Diamadi, M.J. Fischer, R. Peralta, Computation in networks of passively mobile finite-state sensors, in: Distributed Computing [2], pp. 235253.
4. D. Angluin, J. Aspnes, and D. Eisenstat Stably computable predicates are semilinear PODC'06: Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing 2006 ACM Press New York, NY, USA 292 299 (Pubitemid 44393718)
5. D. Angluin, J. Aspnes, and D. Eisenstat Fast computation by population protocols with a leader Distributed Computing 21 3 2008 183 199
6. D. Angluin, J. Aspnes, and D. Eisenstat A simple population protocol for fast robust approximate majority Distributed Computing 21 2 2008 87 102
7. D. Angluin, J. Aspnes, D. Eisenstat, and E. Ruppert The computational power of population protocols Distributed Computing 20 4 2007 279 304 (Pubitemid 350005918)
8. C. lvarez, I. Chatzigiannakis, A. Duch, J. Gabarr, O. Michail, S. Maria, and P.G. Spirakis Computational models for networks of tiny artifacts: a survey Computer Science Review 5 1 2011 7 25
9. C. lvarez, A. Duch, J. Gabarro, and M. Serna Sensor field: a computational model Algorithmic Aspects of Wireless Sensor Networks: 5th International Workshop, ALGOSENSORS 2009, Rhodes, Greece, July 1011, 2009. Revised Selected Papers 2009 Springer-Verlag Berlin, Heidelberg 3 14
10. J. Aspnes, and E. Ruppert An introduction to population protocols Bulletin of the European Association for Theoretical Computer Science 93 October 2007 98 117
11. C. lvarez, M. Serna, P. G. Spirakis, On the computational power of constant memory sensor fields, Technical Report FRONTS-TR-2010-10, 2010.
12. O. Bournez, J. Chalopin, J. Cohen, X. Koegler, Playing with population protocols, in: CSP, 2008, pp. 315.
13. O. Bournez, P. Chassaing, X. Koegler, L. Gerin, and J. Cohen On the convergence of population protocols when population goes to infinity Applied Mathematics and Computation 215 2009 1340 1350
14. J. Beauquier, J. Clement, S. Messika, L. Rosaz, and B. Rozoy Self-stabilizing counting in mobile sensor networks PODC'07: Proceedings of the Twenty-sixth Annual ACM Symposium on Principles of Distributed Computing 2007 ACM New York, NY, USA 396 397 (Pubitemid 350237352)
15. I. Chatzigiannakis, S. Dolev, S.P. Fekete, O. Michail, and P.G. Spirakis Not all fair probabilistic schedulers are equivalent 13th International Conference on Principles of Distributed Systems, OPODIS Lecture Notes in Computer Science vol. 5923 2009 Springer-Verlag Berlin, Heidelberg 33 47
16. n 2 ) are stably computable by the mediated population protocol model 35th International Symposium on Mathematical Foundations of Computer Science, MFCS Lecture Notes in Computer Science vol. 6281 2010 Springer-Verlag 270 281 August 2327
17. n 2 ) are stably computable by the mediated population protocol model, Technical Report FRONTS-TR-2010-17, RACTI, Patras, Greece, 2010.
18. I. Chatzigiannakis, O. Michail, S. Nikolaou, A. Pavlogiannis, P.G. Spirakis, Passively mobile communicating logarithmic space machines, CoRR, abs/1004.3395, 2010, Also FRONTS-TR-2010-16.
19. I. Chatzigiannakis, O. Michail, S. Nikolaou, A. Pavlogiannis, P.G. Spirakis, Passively mobile communicating machines that use restricted space, CoRR, abs/1012.2440, 2010.
20. I. Chatzigiannakis, O. Michail, and P.G. Spirakis Mediated population protocols 36th International Colloquium on Automata, Languages and Programming, ICALP 2009 LNCS vol. 5556 2009 363 374
21. I. Chatzigiannakis, O. Michail, and P.G. Spirakis Recent advances in population protocols MFCS'09: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 2009 Springer-Verlag Berlin, Heidelberg 56 76
22. I. Chatzigiannakis, O. Michail, and P.G. Spirakis Algorithmic verification of population protocols 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS Lecture Notes in Computer Science vol. 6366 2010 Springer-Verlag 221 235
23. I. Chatzigiannakis, O. Michail, and P.G. Spirakis Stably decidable graph languages by mediated population protocols 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS Lecture Notes in Computer Science vol. 6366 2010 Springer-Verlag 252 266
24. I. Chatzigiannakis, and P.G. Spirakis The dynamics of probabilistic population protocols 22nd international symposium on Distributed Computing, DISC Lecture Notes in Computer Science vol. 5218 2008 Springer-Verlag Berlin, Heidelberg 498 499
25. C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, and E. Ruppert When birds die: making population protocols fault-tolerant IEEE 2nd Intl Conference on Distributed Computing in Sensor Systems, DCOSS Lecture Notes in Computer Science vol. 4026 2006 Springer-Verlag 51 66 (Pubitemid 44077818)
26. R. Guerraoui, and E. Ruppert Names trump malice: tiny mobile agents can tolerate byzantine failures 36th International Colloquium on Automata, Languages and Programming, ICALP Lecture Notes in Computer Science vol. 5556 2009 Springer-Verlag 484 495
27. S. Ginsburg, and E.H. Spanier Semigroups, presburger formulas, and languages Pacific Journal of Mathematics 16 1966 285 296
28. N. Immerman Nondeterministic space is closed under complementation SIAM Journal on Computing 17 5 1988 935 938
29. O. Michail, I. Chatzigiannakis, and P.G. Spirakis New Models for Population Protocols N.A. Lynch, Synthesis Lectures on Distributed Computing Theory 2011 Morgan & Claypool Publishers ISBN-10: 1608455890, ISBN-13: 978-1608455898 (published online)
30. C.H. Papadimitriou Computational Complexity 1994 Addison-Wesley
31. M. Presburger, ber die Vollstndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, in: Comptes-Rendus du I Congrs de Mathmaticiens des Pays Slaves, 1929, pp. 92101.
32. P.G. Spirakis Theoretical Aspects of Distributed Computing in Sensor Networks 2010 Springer-Verlag (chapter Population Protocols and Related Models)
33. R. Szelepcsnyi The method of forcing for nondeterministic automata Bulletin of the EATCS 33 1987 96 99