Analysis of Some Variants of the Anderson Array-Based Queuing Mutual Exclusion Protocol with Model Checking and Graphical Animations

Abstract

We report on case studies in which some variants of Anderson Protocol, an array-based queuing mutual exclusion protocol, have been analyzed with Maude, a rewriting logic-based computer language equipped with many facilities, such as model checking ones, and SMGA, a state machine graphical animation tool. We demonstrate that graphical state images help human users grasp some characteristics owned by each state. We also demonstrate that the divide & conquer approach to liveness model checking under fairness makes it feasible to conduct a liveness model checking under fairness that cannot be otherwise completed in a reasonable amount of time.