The Notion of Veto Number and the Respective Power of \Diamond {\cal P} and \Diamond {\cal S} to Solve One-Shot Agreement Problems

DOI10.1007/978-3-540-30186-8_4MaRDI QIDQ5464210zbMATH OpenOpenAlexFDO

Authors Roy Friedman, Achour Mostefaoui, Michel Raynal

Publication date 17 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-30186-8_4

zbMATH Keywords

agreement problemasynchronous distributed systemcomputational powerconsensusinput vectorone-shot problemprocess crashunreliable failure detectorveto number

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• On the computability power and the robustness of set agreement-oriented failure detector classes
• On the hardness of failure-sensitive agreement problems.
• Irreducibility and additivity of set agreement-oriented failure detector classes
• Unreliable failure detectors for reliable distributed systems
• The combined power of conditions and failure detectors to solve asynchronous set agreement

Cited in

(1)

• Distributed Computing - IWDC 2004

This page was built for publication: The Notion of Veto Number and the Respective Power of $\Diamond {\cal P}$ and $\Diamond {\cal S}$ to Solve One-Shot Agreement Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464210)