@inproceedings{ab478d86b499495a939fb4c86f8f2cb5,
title = "An asynchronous computability theorem for fair adversaries",
abstract = "This paper proposes a simple topological characterization of a large class of fair adversarial models via affine tasks: sub-complexes of the second iteration of the standard chromatic subdivision. We show that the task computability of a model in the class is precisely captured by iterations of the corresponding affine task. Fair adversaries include, but are not restricted to, the models of wait-freedom, t-resilience, and k-concurrency. Our results generalize and improve all previously derived topological characterizations of the ability of a model to solve distributed tasks.",
keywords = "Adversarial models, Affine tasks, Topological characterization",
author = "Petr Kuznetsov and Thibault Rieutord and Yuan He",
note = "Publisher Copyright: {\textcopyright} 2018 Copyright held by the owner/author(s). Publication rights licensed to ACM.; 37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018 ; Conference date: 23-07-2018 Through 27-07-2018",
year = "2018",
month = jul,
day = "23",
doi = "10.1145/3212734.3212765",
language = "English",
isbn = "9781450357951",
series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
publisher = "Association for Computing Machinery",
pages = "387--396",
booktitle = "PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing",
}