This case study is based on Lehmann and Rabin's solution to the well known dining philosophers problem [LR81]
  and the analysis of this algorithm by Lynch, Saias and Segala [LSS94].
  
  For more information, see: http://www.prismmodelchecker.org/casestudies/phil_lss.php
  
  =====================================================================================
  
  [LR81]
  D. Lehmann and M. Rabin
  On the Advantages of Free Choice: A Symmetric Fully Distributed Solution to the Dining Philosophers Problem (Extended Abstract)
  In Proc. 8th Symposium on Principles of Programming Languages, pp. 133-138, 1981
  
  LSS94]
  N. Lynch, I. Saias and R. Segala
  Proving Time Bounds for Randomized Distributed Algorithms
  In Proc. 13th ACM Symposium on Principles of Distributed Computing, pp. 314-323, 1994