• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Reactive Probabilistic Programs and Refinement Algebra

Larissa Meinicke, Kim Solin, Reactive Probabilistic Programs and Refinement Algebra. In: B. Möller R. Berghammer, G. Struth (Eds.), Relations and Kleene Algebra in Computer Science, LNCS 4988, 304-319, Springer-Verlag, 2008.

Abstract:

A trace semantics is given for a probabilistic reactive lan-
guage which is capable of modelling probabilistic action
systems. It is shown that reactive probabilistic programs with
the trace semantics form a general refinement algebra. The
abstract-algebraic characterisation means that the proofs of
earlier-established transformation rules can be reused for
probabilistic action systems with trace semantics.

BibTeX entry:

@INPROCEEDINGS{inpMeSo08a,
  title = {Reactive Probabilistic Programs and Refinement Algebra},
  booktitle = {Relations and Kleene Algebra in Computer Science},
  author = {Meinicke, Larissa and Solin, Kim},
  volume = {4988},
  series = {LNCS},
  editor = {R. Berghammer, B. Möller and G. Struth},
  publisher = {Springer-Verlag},
  pages = {304-319},
  year = {2008},
}

Belongs to TUCS Research Unit(s): Distributed Systems Laboratory (DS Lab), Software Construction Laboratorium

Edit publication