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.
1082 Commits
5 Branches
0 Tags
31 MiB
 
 
 
 
 
 
Tree: a00471be4b
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'a00471be4b'
${ noResults }
prism-accumulation/prism-examples/phil_lss
Dave Parker a00471be4b
Added txt extension to README files. 		15 years ago
..
README.txt Added txt extension to README files. 15 years ago
auto Changed auto (commented out parts so run more quickly for testing. 18 years ago
phil_lss3.nm Bug fix in phil_lss model. 18 years ago
phil_lss3.pctl updated reward structures in phil_lss files 18 years ago
phil_lss4.nm Bug fix in phil_lss model. 18 years ago
phil_lss4.pctl updated reward structures in phil_lss files 18 years ago

README.txt 

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

and the analysis of this algorithm by Lynch, Saias and Segala [LSS94].



For more information, see: http://www.prismmodelchecker.org/casestudies/phil_lss.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



LSS94]

N. Lynch, I. Saias and R. Segala

Proving Time Bounds for Randomized Distributed Algorithms

In Proc. 13th ACM Symposium on Principles of Distributed Computing, pp. 314-323, 1994