A theorem on atomicity in distributed algorithms

DOI10.1007/BF01786631MaRDI QIDQ913499zbMATH OpenFDO

Authors Leslie Lamport

Publication date 1990

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01786631

zbMATH Keywords

distributed algorithmsmessage passingReasoningreduction

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4084989
• Distributed Computing
• Complexity of distributed commit protocols
• scientific article; zbMATH DE number 88949
• Impossibility of distributed consensus with one faulty process

Cites work

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

Cited in

(7)

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

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

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