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.
3524 Commits
5 Branches
0 Tags
31 MiB
 
 
 
 
 
 
Tree: 278e103822
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '278e103822'
${ noResults }
prism-accumulation/prism-examples/phil_lss
Joachim Klein 278e103822
Command-line PRISM: skip exports, steady-state and transition computations in exact / parametric mode 		8 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 Example fixes re new semantics (result reported for initial state by default) - need more filters. 15 years ago
phil_lss4.nm Bug fix in phil_lss model. 18 years ago
phil_lss4.pctl Example fixes re new semantics (result reported for initial state by default) - need more filters. 15 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