Irreducibility and additivity of set agreement-oriented failure detector classes

DOI10.1145/1146381.1146406zbMath1314.68078OpenAlexW2103289896MaRDI QIDQ5177276

Michel Raynal, Sergio Rajsbaum, Achour Mostefaoui, Corentin Travers

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00000604

zbMATH Keywords

fault-toleranceasynchronous systemunreliable failure detector

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (2)

On the computability power and the robustness of set agreement-oriented failure detector classes ⋮ The Iterated Restricted Immediate Snapshot Model

This page was built for publication: Irreducibility and additivity of set agreement-oriented failure detector classes