Name
Abstract | ||
|---|---|---|
We identify a refinement algebra for reasoning about probabilistic program transformations in a total-correctness setting. The algebra is equipped with operators that determine whether a program is enabled or terminates respectively. As well as developing ... |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s00165-009-0103-1 | Formal Asp. Comput. |
Keywords | Field | DocType |
forwardandbackward simulation,probabilistic program transformation,refinement,refinement algebra,mondex,total-correctness setting,2-phaseprotocols,synchronisation,protocols,atomic action,atomicactions,serialisation,isolated protocol | Synchronization,Systems theory,Computer science,Algorithm,Diagram,Theoretical computer science,Atomic actions,Interleaving,Computation | Journal |
Volume | Issue | ISSN |
22 | 1 | 1433-299X |
Citations | PageRank | References |
7 | 0.47 | 24 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Richard Banach | 1 | 269 | 29.23 |
| Gerhard Schellhorn | 2 | 769 | 56.43 |