A Sufficient Condition for Gaining Belief in Byzantine Fault-Tolerant Distributed Systems

DOI10.4204/eptcs.379.37arXiv2304.00389OpenAlexW4383645789MaRDI QIDQ6118735

No author found.

Publication date: 28 February 2024

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

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

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The asynchronous bounded-cycle model
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Programming simultaneous actions using common knowledge
• Belief as defeasible knowledge
• Unbeatable consensus
• Epistemic reasoning with Byzantine-faulty agents
• The Theta-Model: achieving synchrony without clocks
• Knowledge and common knowledge in a distributed environment
• The Byzantine Generals Problem
• Distributed computability in Byzantine asynchronous systems

This page was built for publication: A Sufficient Condition for Gaining Belief in Byzantine Fault-Tolerant Distributed Systems