Characterization and Derivation of Heard-Of Predicates for Asynchronous Message-Passing Models

  title={Characterization and Derivation of Heard-Of Predicates for Asynchronous Message-Passing Models},
  author={Adam Shimi and Aur{\'e}lie Hurault and Philippe Qu{\'e}innec},
In distributed computing, multiple processes interact to solve a problem together. The main model of interaction is the message-passing model, where processes communicate by exchanging messages. Nevertheless, there are several models varying along important dimensions: degree of synchrony, kinds of faults, number of faults... This variety is compounded by the lack of a general formalism in which to abstract these models. One way to bring order is to constrain these models to communicate in… Expand

Figures and Tables from this paper


Cutoff bounds for consensus algorithms. In Computer Aided Verification, pages 217–237
  • 2017
The Heard-Of model: computing in distributed systems with benign faults
It is proved that the Consensus problem cannot be generally solved without an implicit and permanent consensus on heard-of sets, and it is demonstrated how this approach leads to shorter and simpler proofs of important results (non-solvability, lower bounds). Expand
Communication Predicates: A High-Level Abstraction for Coping with Transient and Dynamic Faults
  • Martin Hutle, A. Schiper
  • Computer Science
  • 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)
  • 2007
The paper points out limitations of the failure detector model, and suggests instead a model based on communication predicates, called HO model, which allows us to quantify the difference between the required length of anInitial good period and the length of a non initial good period. Expand
Derivation of Heard-of Predicates from Elementary Behavioral Patterns
This work abstracts away the complex models and operations in the Heard-Of model, and defines operations like union, succession or repetition, which makes it easier to build complex models from simple ones while retaining expressivity. Expand
Topological Characterization of Consensus under General Message Adversaries
This paper extends the approach introduced by Alpern and Schneider in 1985 by introducing two novel topologies on the space of infinite executions, and characterize consensus solvability in terms of connectivity of the set of admissible graph sequences. Expand
Characterizing Asynchronous Message-Passing Models Through Rounds
This work formalizes the characterization of message-passing models by introducing Delivered collections: the collections of all messages delivered at each round, whether late or not, and formalizes strategies for when to change round by formalizing strategies on Heard-Of predicates. Expand
Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks
This work presents a consensus algorithm that works correctly under a VSSC ( 1, 4 E + 2 ) message adversary, and provides a k-universal k-set agreement algorithm, where the number of system-wide decision values k is not encoded in the algorithm, but rather determined by the actual power of the message adversary in a run. Expand
Cutoff Bounds for Consensus Algorithms
This work provides an expressive language for consensus algorithms targeting the benign asynchronous setting and gives algorithm-dependent cutoff bounds, the first cutoff result for fault-tolerant distributed systems. Expand
PSync: a partially synchronous language for fault-tolerant distributed algorithms
The high-level lockstep abstraction introduced by PSync simplifies the design and implementation of fault-tolerant distributed algorithms and enables automated formal verification. Expand
A characterization of oblivious message adversaries for which Consensus is solvable
This work gives the first complete necessary and sufficient condition for message adversaries that admits a Consensus algorithm and presents a new algorithm based upon reconstructing a partial, but significant, view of the actual communications that occurred during the evolution of the network. Expand