
The Power of Global Knowledge on Selfstabilizing Population Protocols
In the population protocol model, many problems cannot be solved in a se...
read it

Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs
In this paper, we focus on the uniform bipartition problem in the popula...
read it

Population Protocols Are Fast
A population protocol describes a set of state change rules for a popula...
read it

Towards Refinable Choreographies
We investigate refinement in the context of choreographies. We introduce...
read it

A Characterization of Antidegradable Qubit Channels
This paper provides a characterization for the set of antidegradable qub...
read it

Uniform Partition in Population Protocol Model under Weak Fairness
We focus on a uniform partition problem in a population protocol model. ...
read it

New Clocks, Optimal Line Formation and Efficient Replication Population Protocols (Making Population Protocols Alive)
We consider the model of population protocols permitting presence of dyn...
read it
A Combinatorial Characterization of SelfStabilizing Population Protocols
We fully characterize selfstabilizing functions in population protocols for complete interaction graphs. In particular, we investigate selfstabilization 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 selfstabilization. Specifically we show that functions without certain settheoretic conditions are impossible to compute in a selfstabilizing manner. Our main contribution is in the converse, where we construct a selfstabilizing 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 selfstabilization in this model. We believe it may lend to characterizing selfstabilization in more general models as well.
READ FULL TEXT
Comments
There are no comments yet.