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 19dc966bea Out of date file in phil-original. 16 years ago
..
.autopp Tidy up phil/original (and add pp files). 18 years ago
.philN.nm.pp Bug fix in phil case studies. 17 years ago
README Fixed web addresses in README files. 18 years ago
auto Tidy up phil/original (and add pp files). 18 years ago
phil.pctl "true U" to "F" fix in examples. 17 years ago
phil3.nm Bug fix in phil case studies. 17 years ago
phil4.nm Bug fix in phil case studies. 17 years ago
phil5.nm Bug fix in phil case studies. 17 years ago
phil6.nm Bug fix in phil case studies. 17 years ago
phil7.nm Bug fix in phil case studies. 17 years ago
phil8.nm Bug fix in phil case studies. 17 years ago
phil9.nm Bug fix in phil case studies. 17 years ago
phil10.nm Bug fix in phil case studies. 17 years ago
phil15.nm Bug fix in phil case studies. 17 years ago
phil20.nm Out of date file in phil-original. 16 years ago
phil25.nm Bug fix in phil case studies. 17 years ago
phil30.nm Bug fix in phil case studies. 17 years ago

README

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


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