Formal Modeling, Analysis and Verification of Black White Bakery Algorithm

In this article, Black White (BW) Bakery algorithm is formally analyzed and verified in SPIN model checker. BW Bakery algorithm is first modeled in PROMELA and the model is then verified in SPIN. Mutual exclusion property for the BW Bakery model is verified with inline assertion and as linear temporal logic (LTL) formulas. BW Bakery algorithm uses bounded integers to put a bound on the required space in Bakery algorithm. We also investigate the complete state space and verification time for BW Bakery, original Bakery and Dekker algorithm in SPIN. Obtained results showed that verification time and generated state space for BW Bakery algorithm was much lower than original Bakery algorithm.