2026-07-22T00:09:41Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13132 2024-03-06T10:51:38Z ddc:004 open_access

Brief Announcement: On Decidability of 2-Process Affine Models Kuznetsov, Petr Rieutord, Thibault Affine tasks Decidability Affine models of computation, defined as subsets of iterated immediate-snapshot runs, capture a wide variety of shared-memory systems: 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 task computability of 2-process affine models is decidable and presents a complete hierarchy of five equivalence classes of 2-process affine models. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Petr Kuznetsov and Thibault Rieutord 2020 Is Part Of LIPIcs, Volume 179, 34th International Symposium on Distributed Computing (DISC 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2020.54 urn:nbn:de:0030-drops-131328 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.54 eng https://creativecommons.org/licenses/by/3.0/legalcode