Invariants for the construction of a handshake register

DOI10.1016/S0020-0190(98)00158-6MaRDI QIDQ293438zbMATH OpenOpenAlexFDO

Authors W. H. Hesselink

Publication date 9 June 2016

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

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019098001586?np=y

zbMATH Keywords

distributed computingghost variablehandshakeinvariantregisterwaitfree

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• An assertional criterion for atomicity
• An assertional proof for a construction of an atomic variable
• Wait-free linearization with a mechanical proof
• How a rainbow coloring function can simulate wait-free handshaking
• scientific article; zbMATH DE number 4096767

Cites work

• An axiomatic proof technique for parallel programs
• scientific article; zbMATH DE number 193479 (Why is no real title available?)
• On interprocess communication. II: Algorithms

Cited in

(7)

• Exponential automatic amortized resource analysis
• Decomposing monolithic processes in a process algebra with multi-actions
• State space reduction of linear processes using control flow reconstruction
• How a rainbow coloring function can simulate wait-free handshaking
• Partial-order reduction for parity games with an application on parameterised Boolean equation systems
• Priority promotion with Parysian flair
• Decomposing monolithic processes in a process algebra with multi-actions

This page was built for publication: Invariants for the construction of a handshake register

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