A generalized asynchronous computability theorem
Eli M. Gafni, Petr Kuznetsov, Ciprian Manolescu · 2014
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.