Decision Power of Weak Asynchronous Models of Distributed Computing

@article{Czerner2021DecisionPO,
  title={Decision Power of Weak Asynchronous Models of Distributed Computing},
  author={Philipp Czerner and Roland Guttenberg and Martin Helfrich and Javier Esparza},
  journal={Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing},
  year={2021}
}
Esparza and Reiter have recently conducted a systematic comparative study of models of distributed computing consisting of a network of identical finite-state automata that cooperate to decide if the underlying graph of the network satisfies a given property. The study classifies models according to four criteria, and shows that twenty-four initially possible combinations collapse into seven equivalence classes with respect to their decision power, i.e. the properties that the automata of each… 

Figures from this paper

References

SHOWING 1-10 OF 32 REFERENCES

A Classification of Weak Asynchronous Models of Distributed Computing

It is shown that acceptance by halting configuration only has non-trivial expressive power if it is combined with counting, and that synchronous and interleaving models have the same power as those in which an arbitrary set of nodes can move at the same time.

The computational power of simple protocols for self-awareness on graphs

A simple model, the Mediated Graph Protocol (MGP) model, similar to the Population Protocol model of Angluin et al., is proposed, in which each network link is characterized by a state taken from a finite set.

Expressive Power of Broadcast Consensus Protocols

Inspired by the work of the verification community on Emerson and Namjoshi's broadcast protocols, it is shown that NL-power is also achieved by extending population protocols with reliable broadcasts, a simpler, standard communication primitive.

Computation in networks of passively mobile finite-state sensors

The computational power of networks of small resource-limited mobile agents is explored. Two new models of computation based on pairwise interactions of finite-state agents in populations of finite

The computational power of population protocols

It is proved that all predicates stably computable in this model of population protocols (and certain generalizations of it) are semilinear, answering a central open question about the power of the model.

Brief Announcement: Population Protocols Are Fast

For the first time, it is shown that solutions to a number of fundamental tasks in distributed computing can be obtained quickly using finite-state protocols, including leader election, aggregate and threshold functions on the population, such as majority computation, and plurality consensus.

Asynchronous Distributed Automata: A Characterization of the Modal Mu-Fragment

It is established that the equivalence on finite directed graphs between a class of asynchronous distributed automata and a small fragment of least fixpoint logic and the expressive power of these machines is independent of whether or not messages can be lost.

Terminating population protocols via some minimal global knowledge assumptions

Population Protocols on Graphs: A Hierarchy

This paper considers population protocols acting on families of graphs, that is to say on particular topologies, and exhibits a strict hierarchy in-between when considering graphs between strings and cliques.

Local and global properties in networks of processors (Extended Abstract)

This paper attempts to get at some of the fundamental properties of distributed computing by means of the following question: “How much does each processor in a network of processors need to know