Skip to Main Content
This paper is about Bakery algorithm for mutual exclusion. Three variants of the algorithm for two processes are discussed, formally modelled with a simple process algebra and then verified. Two methods of verification are given. In the first one, the processes representing behaviour of the algorithms are minimised with regard to testing equivalence and then examined. In the second approach, the properties are expressed with temporal logic ACTL and then verified using a model checker. Because we bounded the possible values of variables, the paper contributes new results and knowledge to the well-known facts about Bakery algorithm.