Topological Characterization of Consensus under General Message Adversaries

DOI10.1145/3293611.3331624MaRDI QIDQ5145210zbMATH OpenOpenAlexFDO

Authors Thomas Nowak, Ulrich Schmid, Kyrill Winkler

Publication date 20 January 2021

Published in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

consensusdynamic networksmessage adversariespoint-set topologytopological characterization

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• A characterization of oblivious message adversaries for which consensus is solvable
• On the strongest message adversary for consensus in directed dynamic networks
• A characterization of dynamic networks where consensus is solvable
• Back to the coordinated attack problem

Cited in

(14)

• Valency-based consensus under message adversaries without limit-closure
• Back to the coordinated attack problem
• Derivation of heard-of predicates from elementary behavioral patterns
• scientific article; zbMATH DE number 7407798 (Why is no real title available?)
• A topological perspective on distributed network algorithms
• Synchronous \(t\)-resilient consensus in arbitrary graphs
• Communication pattern logic: epistemic and topological views
• Synchronous t-resilient consensus in arbitrary graphs
• The time complexity of consensus under oblivious message adversaries
• Communication pattern models: an extension of action models for dynamic-network distributed systems
• Locally solvable tasks and the limitations of valency arguments
• Topological characterization of consensus in distributed systems
• Agreement tasks in fault-prone synchronous networks of arbitrary structure
• A topological characterization of stabilizing consensus

This page was built for publication: Topological Characterization of Consensus under General Message Adversaries

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