The Dynamics of Probabilistic Population Protocols

Authors:
Ioannis Chatzigiannakis;Paul G. Spirakis
Affiliations:
Research Academic Computer Technology Institute (CTI), and Department of Computer Engineering and Informatics (CEID), University of Patras, Patras, Greece 26500;Research Academic Computer Technology Institute (CTI), and Department of Computer Engineering and Informatics (CEID), University of Patras, Patras, Greece 26500
Venue:
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Year:
2008

Citing 1
Cited 10

Computation in networks of passively mobile finite-state sensors

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

Mediated Population Protocols

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Not All Fair Probabilistic Schedulers Are Equivalent

OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Algorithmic verification of population protocols

SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Stably decidable graph languages by mediated population protocols

SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Mediated population protocols

Theoretical Computer Science
Passively mobile communicating machines that use restricted space

Theoretical Computer Science
Survey: Computational models for networks of tiny artifacts: A survey

Computer Science Review
Computing with large populations using interactions

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Stone age distributed computing

Proceedings of the 2013 ACM symposium on Principles of distributed computing
The computational power of simple protocols for self-awareness on graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.