s14h
/
prism-accumulation
1
0
Fork 0
Code Releases Activity
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.
462 Commits
5 Branches
0 Tags
31 MiB
 
 
 
 
 
 
Tree: b15d6cc80a
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'b15d6cc80a'
${ noResults }
prism-accumulation/prism-examples/phil/original
Dave Parker b15d6cc80a
Cluster auto file. 		18 years ago
..
.autopp Tidy up phil/original (and add pp files). 18 years ago
.philN.nm.pp Tidy up phil/original (and add pp files). 18 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 Tidy up phil/original (and add pp files). 18 years ago
phil3.nm Tidy up phil/original (and add pp files). 18 years ago
phil4.nm Tidy up phil/original (and add pp files). 18 years ago
phil5.nm Tidy up phil/original (and add pp files). 18 years ago
phil6.nm Tidy up phil/original (and add pp files). 18 years ago
phil7.nm Tidy up phil/original (and add pp files). 18 years ago
phil8.nm Tidy up phil/original (and add pp files). 18 years ago
phil9.nm Tidy up phil/original (and add pp files). 18 years ago
phil10.nm Tidy up phil/original (and add pp files). 18 years ago
phil15.nm Tidy up phil/original (and add pp files). 18 years ago
phil20.nm Model keyword tidy-up: nondeterministic -> mdp. 18 years ago
phil25.nm Tidy up phil/original (and add pp files). 18 years ago
phil30.nm Tidy up phil/original (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].



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