Where academic tradition
meets the exciting future

Probabilistic Demonic Refinement Algebra

Larissa Meinicke, Kim Solin, Probabilistic Demonic Refinement Algebra. SSE-2006-04, 2006.

Abstract:

We propose an abstract algebra for reasoning about probabilistic programs. In contrast to probablisitic Kleene algebra it allows reasoning about total correctness and in addition to weak iteration (Kleene star) also has a strong iteration operator. We extend the algebra with operators that determine whether a program is enabled, has certain failure or does not have certain failure, respectively. The algebra is applied to the derivation of refinement rules for probabilistic action systems.

BibTeX entry:

@TECHREPORT{tMeSo06a,
  title = {Probabilistic Demonic Refinement Algebra},
  author = {Meinicke, Larissa and Solin, Kim},
  year = {2006},
  keywords = {Kleene algebra; probabilistic action systems; demonic refinement algebra},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Edit publication