This case study is based on Rabin's solution to the well known mutual exclusion problem [Rab82].

For more information, see: http://www.prismmodelchecker.org/casestudies/rabin.php

In the subdirectory "modified" there is a modified version of the protocol used for
verifying, given a process tries in the current round, the probability it
enters in the current round

=====================================================================================

[Rab82]
M. Rabin
N-Process Mutual Exclusion with Bounded Waiting by 4log2N-Valued Shared Variable
Journal of Computer and System Sciences, 25(1):66-75, 1982