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.
3157 Commits
5 Branches
0 Tags
31 MiB
 
 
 
 
 
 
Tree: 28b741819d
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '28b741819d'
${ noResults }
prism-accumulation/prism-examples/pta/repudiation
Dave Parker 28b741819d
Optimise computation of expected instantaenous rewards (R[I=k]) for DTMCs when the value is only required for one state (explicit engine). 		10 years ago
..
honest Optimise computation of expected instantaenous rewards (R[I=k]) for DTMCs when the value is only required for one state (explicit engine). 10 years ago
malicious Small tidies in PTA examples. 16 years ago