Self-stabilizing multivalued consensus in asynchronous crash-prone systems

DOI10.1016/J.TCS.2024.114886MaRDI QIDQ6646444zbMATH OpenFDO

Authors Oskar Lundström, Michel Raynal, Elad M. Schiller

Publication date 2 December 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114886

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• \textit{Renaissance}: a self-stabilizing distributed SDN control plane using in-band communications
• Bounded cost algorithms for multivalued consensus using binary consensus instances
• Crash failures can drive protocols to arbitrary states
• Error-free multi-valued consensus with Byzantine failures
• Fault-tolerant message-passing distributed systems. An algorithmic approach
• From binary consensus to multivalued consensus in asynchronous message-passing systems
• Impossibility of distributed consensus with one faulty process
• Introduction to Distributed Self-Stabilizing Algorithms
• Practically stabilizing SWMR atomic memory in message-passing systems
• Practically-self-stabilizing virtual synchrony
• Self-stabilization
• Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks
• Self-stabilizing group communication in directed networks
• Self-stabilizing systems in spite of distributed control
• The \(k\)-simultaneous consensus problem
• Unreliable failure detectors for reliable distributed systems
• When consensus meets self-stabilization

Cited in

(3)

• Self-stabilizing multivalued consensus in the presence of Byzantine faults and asynchrony
• Self-stabilizing snapshot objects for asynchronous failure-prone networked systems
• Practically-self-stabilizing vector clocks without scheduling fairness

This page was built for publication: Self-stabilizing multivalued consensus in asynchronous crash-prone systems

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