论文标题
公平对手的异步计算定理
An Asynchronous Computability Theorem for Fair Adversaries
论文作者
论文摘要
本文提出了通过仿射任务对大型公平对抗模型的简单拓扑表征：标准色素细分的第二次迭代的子复合物。我们表明，类模型的任务可计算性是通过相应的仿射任务的迭代来精确捕获的。公平的对手包括但不限于候补，T-弹性和$ K $ concrency的模型。我们的结果概括并改善了模型解决分布式任务的能力的所有先前得出的拓扑特征。
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.
