A Comparative Case-Study in Formal Verification Groote and the second author verified (a version of) the Bakery Protocol in $muCRL$. 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. Subject classification:

, , ,
, , , ,
Department of Computer Science [CS]

Griffioen, W.O.D, & Korver, H.P. (1995). The bakery protocol : a comparitive case-study in formal verification. Department of Computer Science [CS]. CWI.