scientific article; zbMATH DE number 88949

MaRDI QIDQ4016526zbMATH OpenFDO

Authors Ambuj Singh

Publication date 16 January 1993

zbMATH Keywords

distributed consensusparallel programtemporal logicUNITY

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• An Intuitionistic Epistemic Logic for Sequential Consistency on Shared Memory
• Impossibility of distributed consensus with one faulty process
• A criterion for atomicity
• Waiting in concurrent algorithms
• Are wait-free algorithms fast?

Cited in

(5)

• Towards an understanding of unbounded variables in asynchronous systems
• A simple constructive computability theorem for wait-free computation
• A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions
• Separating Lock-Freedom from Wait-Freedom
• A theorem on atomicity in distributed algorithms

This page was built for publication:

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