Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast

DOI10.1016/j.tcs.2023.114070arXiv2201.12880MaRDI QIDQ6047193

Michel Raynal, Romaric Duvignau, Elad M. Schiller

Publication date: 7 September 2023

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

Full work available at URL: https://arxiv.org/abs/2201.12880

zbMATH Keywords

fault-toleranceself-stabilizationreliable broadcast

Mathematics Subject Classification ID

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

Related Items (1)

Self-stabilizing indulgent zero-degrading binary consensus

Cites Work

• Unnamed Item
• Unnamed Item
• Self-stabilizing Byzantine asynchronous unison
• Approximate agreement under mobile Byzantine faults
• Self-stabilizing Byzantine-tolerant distributed replicated state machine
• Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks
• Stabilizing Server-Based Storage in Byzantine Asynchronous Message-Passing Systems
• Asynchronous consensus and broadcast protocols
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Self-stabilizing systems in spite of distributed control
• Self-Stabilizing Snapshot Objects for Asynchronous Failure-Prone Networked Systems
• Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy as Consensus
• Fault-Tolerant Message-Passing Distributed Systems
• Introduction to Distributed Self-Stabilizing Algorithms

This page was built for publication: Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast