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.
|
|
16 years ago | |
|---|---|---|
| .. | ||
| .autopp | 16 years ago | |
| .philN.nm.pp | 17 years ago | |
| README | 18 years ago | |
| auto | 18 years ago | |
| phil.pctl | 17 years ago | |
| phil3.nm | 17 years ago | |
| phil4.nm | 17 years ago | |
| phil5.nm | 17 years ago | |
| phil6.nm | 17 years ago | |
| phil7.nm | 17 years ago | |
| phil8.nm | 17 years ago | |
| phil9.nm | 17 years ago | |
| phil10.nm | 17 years ago | |
| phil15.nm | 17 years ago | |
| phil20.nm | 16 years ago | |
| phil25.nm | 17 years ago | |
| phil30.nm | 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