Back to the Coordinated Attack Problem

DOI10.1017/S0960129521000037zbMath1495.68019arXiv2103.10816OpenAlexW3177915645MaRDI QIDQ5006457

Emmanuel Godard, Eloi Perdereau

Publication date: 16 August 2021

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

distributed systemssimplicial complexesfault tolerancetopological methodscoordinated attack problemconsensussynchronous systemsdistributed computabilitymessage-passingmessage adversariesomission faultstwo armies problemtwo generals problem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
• A characterization of oblivious message adversaries for which consensus is solvable
• The Heard-Of model: computing in distributed systems with benign faults
• Agreement in synchronous networks with ubiquitous faults
• The unified structure of consensus
• A generalized asynchronous computability theorem
• Tight bounds for k -set agreement
• The topological structure of asynchronous computability
• Design and Analysis of Distributed Algorithms
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• Time is not a healer
• Topological Characterization of Consensus under General Message Adversaries
• Generalized FLP impossibility result for t-resilient asynchronous computations

This page was built for publication: Back to the Coordinated Attack Problem