A theorem on atomicity in distributed algorithms

DOI10.1007/BF01786631zbMath0699.68044MaRDI QIDQ913499

Leslie Lamport

Publication date: 1990

Published in: Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

reductiondistributed algorithmsmessage passingReasoning

Mathematics Subject Classification ID

Theory of operating systems (68N25) Algorithms in computer science (68W99)

Related Items (6)

Verification of schedulability for real-time programs ⋮ A formal language for cryptographic protocol requirements ⋮ Temporal predicate transition nets—a new formalism for specifying and verifying concurrent systems ⋮ Using refinement calculus techniques to prove linearizability ⋮ Transformation of programs for fault-tolerance ⋮ Global serializability of concurrent programs

Cites Work

• Defining liveness
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Reduction

This page was built for publication: A theorem on atomicity in distributed algorithms