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.
586 Commits
5 Branches
0 Tags
31 MiB
 
 
 
 
 
 
Tree: eac1f55e32
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'eac1f55e32'
${ noResults }
prism-accumulation/prism-examples/rabin
Dave Parker eac1f55e32
Added consensus to examples. 		17 years ago
..
modified minor fixes 17 years ago
.autopp Rabin: tidy up. 18 years ago
.rabinN.nm.pp Rabin: tidy up. 18 years ago
README modified versionof rabin 17 years ago
auto Changed auto (commented out parts so run more quickly for testing. 18 years ago
rabin.pctl Props: "true U" -> "F". 18 years ago
rabin3.nm Rabin: tidy up. 18 years ago
rabin4.nm Rabin: tidy up. 18 years ago
rabin5.nm Rabin: tidy up. 18 years ago
rabin6.nm Rabin: tidy up. 18 years ago
rabin8.nm Rabin: tidy up. 18 years ago
rabin10.nm Rabin: tidy up. 18 years ago
rabin12.nm Rabin: tidy up. 18 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.prismmodelchecker.org/casestudies/rabin.php

In the subdirectory "modified" there is a modified version of the protocol used for
verifying, given a process tries in the current round, the probability it
enters in the current round



=====================================================================================



[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