Logical classification of distributed algorithms (Bakery algorithms as an example)

DOI10.1016/j.tcs.2011.01.030zbMath1221.68162OpenAlexW2043514550MaRDI QIDQ541220

Uri Abraham

Publication date: 6 June 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.030

zbMATH Keywords

distributed algorithmsmutual exclusionlogical classificationmodels of concurrencyTarski structures

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)

Related Items

Mutual exclusion as a matter of priority ⋮ Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On interprocess communication. I: Basic formalism
• Modeling concurrency with partial orders
• The synchronization of independent processes
• The Birth of Model Checking
• A New Approach to Proving the Correctness of Multiprocess Programs
• Time, clocks, and the ordering of events in a distributed system
• A little knowledge goes a long way
• A new solution of Dijkstra's concurrent programming problem
• The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms