License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2020.54
URN: urn:nbn:de:0030-drops-131328
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13132/
Go to the corresponding LIPIcs Volume Portal

Kuznetsov, Petr ; Rieutord, Thibault

Brief Announcement: On Decidability of 2-Process Affine Models

pdf-format:
LIPIcs-DISC-2020-54.pdf (0.3 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{kuznetsov_et_al:LIPIcs:2020:13132,
  author =	{Petr Kuznetsov and Thibault Rieutord},
  title =	{{Brief Announcement: On Decidability of 2-Process Affine Models}},
  booktitle =	{34th International Symposium on Distributed Computing (DISC 2020)},
  pages =	{54:1--54:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-168-9},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{179},
  editor =	{Hagit Attiya},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/13132},
  URN =		{urn:nbn:de:0030-drops-131328},
  doi =		{10.4230/LIPIcs.DISC.2020.54},
  annote =	{Keywords: Affine tasks, Decidability}
}

Keywords: Affine tasks, Decidability
Collection: 34th International Symposium on Distributed Computing (DISC 2020)
Issue Date: 2020
Date of publication: 07.10.2020

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI