Brief announcement: on decidability of 2-process affine models - Télécom Paris Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Brief announcement: on decidability of 2-process affine models

Résumé

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.
Fichier principal
Vignette du fichier
LIPIcs.DISC.2020.54.pdf (606.45 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Licence

Dates et versions

hal-03022583 , version 1 (19-07-2024)

Licence

Identifiants

Citer

Petr Kuznetsov, Thibault Rieutord. Brief announcement: on decidability of 2-process affine models. DISC 2020 - : 34th International Symposium on Distributed Computing, Oct 2020, Virtual event, France. pp.54:1-54:3, ⟨10.4230/LIPIcs.DISC.2020.54⟩. ⟨hal-03022583⟩
23 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More