You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 
Dave Parker 6b5006fe8a Tidy up phil/nofair (and add pp files). 18 years ago
..
.autopp Tidy up phil/nofair (and add pp files). 18 years ago
.phil-nofairN.nm.pp Tidy up phil/nofair (and add pp files). 18 years ago
README Fixed web addresses in README files. 18 years ago
auto Tidy up phil/nofair (and add pp files). 18 years ago
phil-nofair3.nm Tidy up phil/nofair (and add pp files). 18 years ago
phil-nofair4.nm Tidy up phil/nofair (and add pp files). 18 years ago
phil-nofair5.nm Tidy up phil/nofair (and add pp files). 18 years ago
phil-nofair6.nm Tidy up phil/nofair (and add pp files). 18 years ago
phil-nofair7.nm Tidy up phil/nofair (and add pp files). 18 years ago
phil-nofair8.nm Tidy up phil/nofair (and add pp files). 18 years ago
phil-nofair9.nm Tidy up phil/nofair (and add pp files). 18 years ago
phil-nofair10.nm Model keyword tidy-up: nondeterministic -> mdp. 18 years ago
phil.pctl Tidy up phil/nofair (and add pp files). 18 years ago

README

This case study is based on Lehmann and Rabin's solution to the well known dining philosophers problem [LR81].

It considers the version presented in [DFP04] which removes the need to consider 'fairness' assumptions on the scheduling mechanism.

For more information, see: http://www.prismmodelchecker.org/casestudies/phil.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

[DFP04]
M. Duflot, L. Fribourg and C. Picaronny
Randomized dining philosophers without fairness assumption
Distributed Computing, 17(1):65-76, 2004