Lamport's bakery algorithm
Semantic Scholar uses AI to extract papers important to this topic.
- Formal Aspects of Computing
Lamport’s Bakery Algorithm (Commun ACM 17:453–455, 1974) implements mutual exclusion for a fixed number of threads with the first… (More)
- Sci. Comput. Program.
Proof assistants like PVS can be used fruitfully for the design and verification of concurrent algorithms. The technique is… (More)
We present a specification of Lamport’s Bakery algorithm written in AsmL specification language. By exploration of the state… (More)
A mutual exclusion algorithm is presented that has four desired properties: (1) it satisfies FIFO fairness, (2) it satisfies… (More)
We present a model checking algorithm for safety properties that is applicable to parameterized systems and hence provides a… (More)
- Specification and validation methods
In a meeting at Schloss Dagstuhl in June 1993, Uri Abraham and Menachem Magidor have challenged the thesis that an evolving… (More)
- Operating Systems Review
The Lamport's mutual exclusion exclusion algorithm, also known as the bakery algorithm, is very simple and easy to implement… (More)
An algorithm is proposed that creates mutual exclusion in a computer network whose nodes communicate only by messages and do not… (More)
- ACM Trans. Program. Lang. Syst.
A new, nonassertional approach to proving multiprocess program correctness is described by proving the correctness of a new… (More)