Reactive probabilistic programs and refinement algebra

L. A. Meinicke, K. Solin

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

3 Citations (Scopus)

Abstract

A trace semantics is given for a probabilistic reactive language 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.

Original languageEnglish
Title of host publicationRelations and Kleene Algebra in Computer Science - 10th Int. Conference on Relational Methods in Comput. Sci. and 5th Int. Conference on Applications of Kleene Algebra, RelMiCS/AKA 2008, Proceedings
EditorsRudolf Berghammer, Bernhard Möller, Georg Struth
Pages304-319
Number of pages16
Volume4988 LNCS
DOIs
Publication statusPublished - 2008
Event10th International Conference on Relational Methods in Computer Science and 5th International Conference on Applications of Kleene Algebra, RelMiCS/AKA 2008 - Frauenworth, Germany
Duration: 7 Apr 200811 Apr 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4988 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other10th International Conference on Relational Methods in Computer Science and 5th International Conference on Applications of Kleene Algebra, RelMiCS/AKA 2008
CountryGermany
CityFrauenworth
Period7/04/0811/04/08

Fingerprint Dive into the research topics of 'Reactive probabilistic programs and refinement algebra'. Together they form a unique fingerprint.

Cite this