Abstract
A condition C is a set of input vectors to a problem. A class of conditions that allow to solve k-set agreement in spite of f crashes in an asynchronous system is identified. A k-set agreement protocol that is always safe is described: it is guaranteed to terminate when the input vector belongs to C and it always decides on at most k different values, even if the input vector does not belong to C. While there are simple solutions when f
Cite
CITATION STYLE
Mostéfaoui, A., Rajsbaum, S., Raynal, M., & Roy, M. (2002). Condition-based protocols for set agreement problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2508, pp. 48–62). Springer Verlag. https://doi.org/10.1007/3-540-36108-1_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
