Refinement Algebra for Probabilistic Programs

Larissa Meinicke*, Kim Solin

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


We propose an abstract refinement algebra for reasoning about probabilistic programs in a total-correctness setting. The algebra is equipped with operators that determine whether a program is enabled, has certain failure or does not have certain failure, respectively. As an application, refinement rules for probabilistic action systems are derived in the algebra.

Original languageEnglish
Pages (from-to)177-195
Number of pages19
JournalElectronic Notes in Theoretical Computer Science
Issue numberC
Publication statusPublished - 7 Mar 2008


  • action systems
  • data refinement
  • Kleene algebra
  • probability
  • refinement algebra


Dive into the research topics of 'Refinement Algebra for Probabilistic Programs'. Together they form a unique fingerprint.

Cite this