Towards an understanding of unbounded variables in asynchronous systems

DOI10.1016/0020-0190(92)90125-FzbMATH Open0780.68037OpenAlexW2027595883MaRDI QIDQ1198014FDOQ1198014

Authors: Ambuj Singh 

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90125-f

Recommendations

• On the use of registers in achieving wait-free consensus
• How to share concurrent wait-free variables
• Bounded delay for a free address
• The concurrency hierarchy, and algorithms for unbounded concurrency
• scientific article; zbMATH DE number 1873274

zbMATH Keywords

bounded variablesconcurrencyprogram derivationasynchronous wait- free low-atomicity systemshierarchical construction of atomic registersunbounded variables

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• On interprocess communication. II: Algorithms
• Protocol Verification via Projections
• Title not available (Why is that?)

This page was built for publication: Towards an understanding of unbounded variables in asynchronous systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198014)