Population Protocols on Graphs: A Hierarchy
Population protocols have been introduced as a model in which anonymous finite-state agents stably compute a predicate of the multiset of their inputs via interactions by pairs. In this paper, we consider population protocols acting on families of graphs, that is to say on particular topologies. Stably computable predicates on strings of size n correspond exactly to languages of NSPACE(n), that is to say to non-deterministic space of Turing machines. Stably computable predicates on cliques correspond to semi-linear predicates, namely exactly those definable in Presburger’s arithmetic. Furthermore, we exhibit a strict hierarchy in-between when considering graphs between strings and cliques.
Keywordspopulation protocols computability hierarchy space complexity
Unable to display preview. Download preview PDF.
- 1.Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, pp. 290–299. ACM (2004)Google Scholar
- 5.Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols, vol. 3, p. 13 (November 2008)Google Scholar
- 6.Aspnes, J., Ruppert, E.: An introduction to population protocols. Bulletin of the EATCS 93, 106–125 (2007)Google Scholar
- 7.Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., Spirakis, P.G.: Passively mobile communicating machines that use restricted space. Theoretical Computer Science (2011)Google Scholar
- 9.Guerraoui, R., Ruppert, E.: Names trump malice: Tiny mobile agents can tolerate byzantine failures, pp. 484–495 (2009)Google Scholar
- 10.Saks, M.: Randomization and derandomization in space-bounded computation. In: Proceedings of the Eleventh Annual IEEE Conference on Computational Complexity, pp. 128–149. IEEE (1996)Google Scholar