More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems (Q1260652)

The paper defines the general consensus problem for protocols where each processor decides on a single value such that the set of decided values in any run is the size of a given set. The motivation for studying the problem is to test whether the number of choices allowed to the processors is related to the number of faults. The main result of the paper is the assumption of a totally asynchronous system that characterizes the boundary between possibility and impossibility of given multiple faults.