Groote and the second author verified (a version of) the Bakery Protocol in μCRL.
Their process-algebraic verification is rather complex compared to the protocol. Now the question is: How do other verification techniques perform on this protocol? In this paper we present a new correctness proof by using I/O-automata theory and discuss the relative
merits of both approaches
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.