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.
Mark Kattenbelt
be7fe1aec8
|
19 years ago | |
|---|---|---|
| .. | ||
| README | 20 years ago | |
| auto | 20 years ago | |
| phil3.nm | 20 years ago | |
| phil3.pctl | 20 years ago | |
| phil4.nm | 20 years ago | |
| phil4.pctl | 20 years ago | |
| phil5.nm | 20 years ago | |
| phil5.pctl | 20 years ago | |
| phil6.nm | 20 years ago | |
| phil6.pctl | 20 years ago | |
| phil7.nm | 20 years ago | |
| phil7.pctl | 20 years ago | |
| phil8.nm | 20 years ago | |
| phil8.pctl | 20 years ago | |
| phil9.nm | 20 years ago | |
| phil9.pctl | 20 years ago | |
| phil10.nm | 20 years ago | |
| phil10.pctl | 20 years ago | |
| phil15.nm | 20 years ago | |
| phil15.pctl | 20 years ago | |
| phil20.nm | 20 years ago | |
| phil20.pctl | 20 years ago | |
| phil25.nm | 20 years ago | |
| phil25.pctl | 20 years ago | |
| phil30.nm | 20 years ago | |
| phil30.pctl | 20 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.cs.bham.ac.uk/~dxp/prism/casestudies/phil.html
=====================================================================================
[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