Topological Characterization of Consensus under General Message Adversaries

DOI10.1145/3293611.3331624OpenAlexW2964057700MaRDI QIDQ5145210

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 networkspoint-set topologytopological characterizationmessage adversaries

Mathematics Subject Classification ID

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

Related Items (7)

Derivation of Heard-of Predicates from Elementary Behavioral Patterns ⋮ Valency-based consensus under message adversaries without limit-closure ⋮ Synchronous \(t\)-resilient consensus in arbitrary graphs ⋮ Communication pattern logic: epistemic and topological views ⋮ A topological perspective on distributed network algorithms ⋮ Unnamed Item ⋮ Back to the Coordinated Attack Problem

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