The Dynamics of Probabilistic Population Protocols

Brief Announcement
  • Ioannis Chatzigiannakis
  • Paul G. Spirakis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5218)


Angluin et al. [1] introduced the notion of “Probabilistic Population Protocols” (PPP) where extremely limited agents are represented as finite state machines that interact in pairs under the control of an adversary scheduler. We provide a very general model that allows to examine the continuous dynamics of population protocols and we show that it includes the model of [1], under certain conditions, with respect to the continuous dynamics of the two models.


  1. 1.
    Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 290–299. ACM, New York (2004)Google Scholar
  2. 2.
    Hirsch, M., Smale, S.: Differential Equations, Dynamical Systems and Linear Algebra. Academic Press, London (1974)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Ioannis Chatzigiannakis
    • 1
  • Paul G. Spirakis
    • 1
  1. 1.Research Academic Computer Technology Institute (CTI), and Department of Computer Engineering and Informatics (CEID)University of PatrasPatrasGreece

Personalised recommendations