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.
132 Commits
5 Branches
0 Tags
31 MiB
 
 
 
 
 
 
Tree: 3b0cc0e571
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '3b0cc0e571'
${ noResults }
prism-accumulation/prism-examples/phil_lss
Mark Kattenbelt 3b0cc0e571
Changed the simulators table mechanism substantially. It is now easier to hide variables (and in future configure more options). It is now the PathTableModel who is responsible for this, making it a lot easier to add variables back to the view. Also added a couple of extra menu options to the pop-up menu. 		20 years ago
..
README Renaming examples directory to prism-examples. 20 years ago
auto Renaming examples directory to prism-examples. 20 years ago
phil_lss3.nm Renaming examples directory to prism-examples. 20 years ago
phil_lss3.pctl Renaming examples directory to prism-examples. 20 years ago
phil_lss4.nm Renaming examples directory to prism-examples. 20 years ago
phil_lss4.pctl Renaming examples directory to prism-examples. 20 years ago

README 

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.cs.bham.ac.uk/~dxp/prism/casestudies/phil_lss.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



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