A Classification of Weak Asynchronous Models of Distributed Computing

07/07/2020
by   Javier Esparza, et al.
0

We conduct a systematic study of asynchronous models of distributed computing consisting of identical finite-state devices that cooperate in a network to decide if the network satisfies a given graph-theoretical property. Models discussed in the literature differ in the detection capabilities of the agents residing at the nodes of the network (detecting the set of states of their neighbors, or counting the number of neighbors in each state), the notion of acceptance (acceptance by halting in a particular configuration, or by stable consensus), the notion of step (synchronous move, interleaving, or arbitrary timing), and the fairness assumptions (non-starving, or stochastic-like). We study the expressive power of the combinations of these features, and show that the initially twenty possible combinations fit into seven equivalence classes. The classification is the consequence of several equi-expressivity results with a clear interpretation. In particular, we show 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. We also identify simple graph properties that distinguish the expressive power of the seven classes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/30/2021

State Complexity of Counting Population Protocols With Leaders

Population protocols are a model of computation in which an arbitrary nu...
research
05/16/2018

Distributed Automata and Logic

Distributed automata are finite-state machines that operate on finite di...
research
05/24/2022

Asynchronous Neural Networks for Learning in Graphs

This paper studies asynchronous message passing (AMP), a new paradigm fo...
research
07/01/2021

A Discrete-time Reputation-based Resilient Consensus Algorithm for Synchronous or Asynchronous Communications

We tackle the problem of a set of agents achieving resilient consensus i...
research
09/17/2021

Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent

We show the equivalence of two distributed computing models, namely reco...
research
02/07/2021

Asynchronous semi-anonymous dynamics over large-scale networks

We analyze a class of stochastic processes, referred to as asynchronous ...
research
10/22/2020

Automata and Fixpoints for Asynchronous Hyperproperties

Hyperproperties have received increasing attention in the last decade du...

Please sign up or login with your details

Forgot password? Click here to reset