Mutual exclusion as a matter of priority

DOI10.1016/j.tcs.2016.12.015zbMath1407.68068OpenAlexW2570081158MaRDI QIDQ1625608

Yoram Moses, Katia Patkin

Publication date: 29 November 2018

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

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

zbMATH Keywords

mutual exclusionasynchronous computingbakery algorithmsafe registers

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Logical classification of distributed algorithms (Bakery algorithms as an example)
• On interprocess communication. I: Basic formalism
• Knowledge and common knowledge in a distributed environment
• A New Approach to Proving the Correctness of Multiprocess Programs
• A new solution of Dijkstra's concurrent programming problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mutual exclusion as a matter of priority