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

Abstract

We establish the equivalence between a class of asynchronous distributed automata and a small fragment of least fixpoint logic, when restricted to finite directed graphs. More specifically, the logic we consider is (a variant of) the fragment of the modal $\mu$-calculus that allows least fixpoints but forbids greatest fixpoints. The corresponding automaton model uses a network of identical finite-state machines that communicate in an asynchronous manner and whose state diagram must be acyclic except for self-loops. Exploiting the connection with logic, we also prove that the expressive power of those machines is independent of whether or not messages can be lost.

13 pages, 2 figures

Cited by in corpus (3)

• Identifiers in Registers - Describing Network Algorithms with Logic
• Decision Power of Weak Asynchronous Models of Distributed Computing
• Emptiness Problems for Distributed Automata