On Decidability of 2-process Affine Models
Distributed, Parallel, and Cluster Computing
2020-08-06 v1
Abstract
An affine model of computation is defined as a subset of iterated immediate-snapshot runs, capturing a wide variety of shared-memory systems, such as wait-freedom, t-resilience, k-concurrency, and fair shared-memory adversaries. The question of whether a given task is solvable in a given affine model is, in general, undecidable. In this paper, we focus on affine models defined for a system of two processes. We show that the task computability of 2-process affine models is decidable and presents a complete hierarchy of the five equivalence classes of 2-process affine models.
Cite
@article{arxiv.2008.02099,
title = {On Decidability of 2-process Affine Models},
author = {Petr Kuznetsov and Thibault Rieutord},
journal= {arXiv preprint arXiv:2008.02099},
year = {2020}
}