A Combinatorial Characterization of Self-Stabilizing Population Protocols

We fully characterize self-stabilizing functions in population protocols for complete interaction graphs. In particular, we investigate self-stabilization in systems of $n$ finite state agents in which a malicious scheduler selects an arbitrary sequence of pairwise interactions under a global fairness condition. We show a necessary and sufficient condition for self-stabilization. Specifically we show that functions without certain set-theoretic conditions are impossible to compute in a self-stabilizing manner. Our main contribution is in the converse, where we construct a self-stabilizing protocol for all other functions that meet this characterization. Our positive construction uses Dickson's Lemma to develop the notion of the root set, a concept that turns out to fundamentally characterize self-stabilization in this model. We believe it may lend to characterizing self-stabilization in more general models as well.

[1]  David Eisenstat,et al.  The computational power of population protocols , 2006, Distributed Computing.

[2]  Rafail Ostrovsky,et al.  Memory-efficient and self-stabilizing network RESET (extended abstract) , 1994, PODC '94.

[3]  L. Dickson.  Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[4]  Michael J. Fischer,et al.  Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.

[5]  Shay Kutten,et al.  Making Population Protocols Self-stabilizing , 2009, SSS.

[6]  Jehoshua Bruck,et al.  Programmability of Chemical Reaction Networks , 2009, Algorithmic Bioprocesses.

[7]  Fukuhito Ooshita,et al.  Loosely-Stabilizing Leader Election with Polylogarithmic Convergence Time , 2018, OPODIS.

[8]  Rafail Ostrovsky,et al.  Population Stability: Regulating Size in the Presence of an Adversary , 2018, PODC.

[9]  Chuan Xu,et al.  Time-Optimal Self-Stabilizing Leader Election in Population Protocols , 2019, PODC.

[10]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[11]  James Aspnes,et al.  An Introduction to Population Protocols , 2007, Bull. EATCS.

[12]  Michael J. Fischer,et al.  Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents , 2006, OPODIS.

[13]  Joffroy Beauquier,et al.  Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs , 2013, OPODIS.

[14]  Rafail Ostrovsky,et al.  Self-stabilizing symmetry breaking in constant-space (extended abstract) , 1992, STOC '92.

[15]  Koichi Wada,et al.  How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model , 2012, Theory of Computing Systems.

[16]  Michael J. Fischer,et al.  Self-stabilizing population protocols , 2005, TAAS.

[17]  Tomoko Izumi,et al.  Space-efficient self-stabilizing counting population protocols on mobile sensor networks , 2014, Theor. Comput. Sci..

[18]  Shay Kutten,et al.  Brief announcement: non-self-stabilizing and self-stabilizing gathering in networks of mobile agents--the notion of speed , 2009, PODC '09.