@inproceedings{aec82d0fef4042d98bd5fcd9c3e6feb3,
title = "A generalized Asynchronous Computability Theorem",
abstract = "We consider the models of distributed computation defined as subsets of the runs of the iterated immediate snapshot model. Given a task T and a model M, we provide topological conditions for T to be solvable in M. When applied to the wait-free model, our conditions result in the celebrated Asynchronous Computability Theorem (ACT) of Herlihy and Shavit. To demonstrate the utility of our characterization, we consider a task that has been shown earlier to admit only a very complex t-resilient solution. In contrast, our generalized computability theorem confirms its t-resilient solvability in a straightforward manner.",
keywords = "Asynchronous computability, Characterization, Iterated models, Topology",
author = "Eli Gafni and Petr Kuznetsov and Ciprian Manolescu",
year = "2014",
month = jan,
day = "1",
doi = "10.1145/2611462.2611477",
language = "English",
isbn = "9781450329446",
series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
publisher = "Association for Computing Machinery",
pages = "222--231",
booktitle = "PODC 2014 - Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing",
note = "2014 ACM Symposium on Principles of Distributed Computing, PODC 2014 ; Conference date: 15-07-2014 Through 18-07-2014",
}