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
5144e75d66
|
19 years ago | |
|---|---|---|
| .. | ||
| README | 20 years ago | |
| auto | 20 years ago | |
| rabin3.nm | 20 years ago | |
| rabin3.pctl | 20 years ago | |
| rabin4.nm | 20 years ago | |
| rabin4.pctl | 20 years ago | |
| rabin5.nm | 20 years ago | |
| rabin5.pctl | 20 years ago | |
| rabin6.nm | 20 years ago | |
| rabin6.pctl | 20 years ago | |
| rabin8.nm | 20 years ago | |
| rabin8.pctl | 20 years ago | |
| rabin10.nm | 20 years ago | |
| rabin10.pctl | 20 years ago | |
| rabin12.nm | 20 years ago | |
| rabin12.pctl | 20 years ago | |
README
This case study is based on Rabin's solution to the well known mutual exclusion problem [Rab82].
For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/rabin.html
=====================================================================================
[Rab82]
M. Rabin
N-Process Mutual Exclusion with Bounded Waiting by 4log2N-Valued Shared Variable
Journal of Computer and System Sciences, 25(1):66-75, 1982