This article introduces and explores the condition-based approach to solve the consensus
problem in asynchronous systems. The approach studies conditions that identify sets of …

This paper presents a very simple consensus protocol that converges in a single
communication step in favorable circumstances. Those situations occur when “enough” …

The Byzantine consensus problem involves n processes, out of which t< n could be faulty
and behave arbitrarily. Three properties characterize consensus:(1) termination, requiring …

In the renaming task n+ 1 processes start with unique input names taken from a large space
and must choose unique output names taken from a smaller name space, 0, 1,..., K. To rule …

The condition-based approach for consensus solvability consists of identifying sets of input
vectors, called conditions, for which there exists an asynchronous protocol solving …

As the structure of contemporary communication networks grows more complex, practical
networked distributed systems become prone to component failures. Fault-tolerant …

To cope with the impossibility of solving agreement problems in asynchronous systems
made up of n processes and prone to t process crashes, system designers tailor their …

In a system with limited-scope failure detectors, there are q disjoint clusters of processes
such that some correct process in each cluster is never suspected by any process in that …

Multi-valued validated Byzantine agreement (MVBA), a fundamental primitive of distributed
computing, enables n processes to agree on a valid L-bit value, despite t faulty processes …

The condition based approach identifies sets of input vectors, called conditions, for which it
is possible to design a protocol solving a distributed problem despite process crashes. This …