A proof of burns N-process mutual exclusion algorithm using abstraction [chapter]

Henrik E. Jensen, Nancy A. Lynch
1998 Lecture Notes in Computer Science  
Within the Input/Output Automata framework, we state and prove a general abstraction theorem giving conditions for preservation of safety properties from one automaton to another. We use our abstraction theorem to verify that Burns distributed mutual exclusion algorithm parameterized in the number of processes n satisfies the mutual exclusion property. The concrete n-process algorithm is abstracted by a simple 2-process algorithm which is property preserving with respect to the mutual exclusion
more » ... property. The condition for property preservation is proved to be satisfied by use of the LP theorem prover with a minimum of user assistance, and the 2-process abstraction is automatically verified using the SPIN model checker.
doi:10.1007/bfb0054186 fatcat:vat3youkjja4zfax5lkho3vuqq