Probabilistic Choice in Refinement Algebra

Meinicke, Larissa; Hayes, Ian J.

doi:10.1007/978-3-540-70594-9_14

Search citation statements

Order By: Relevance

Paper Sections

Select...

Limitations Of the Algebra1

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Article2

Book1

Relationship

Self Cite1

Independent2

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although, as identified in the introduction, many fundamental transformation theorems only require implicit reasoning about this operator. Further investigations into probabilistic extensions to gRA may be found [MH08a]. The work here is foundational to such extensions.…”

Section: Limitations Of the Algebramentioning

confidence: 85%

Refinement algebra for probabilistic programs

Meinicke¹,

Solin²

2010

Form. Asp. Comput.

Self Cite

View full text Add to dashboard Cite

Abstract.We identify a refinement algebra for reasoning about probabilistic program transformations in a totalcorrectness setting. The algebra is equipped with operators that determine whether a program is enabled or terminates respectively. As well as developing the basic theory of the algebra we demonstrate how it may be used to explain key differences and similarities between standard (i.e. non-probabilistic) and probabilistic programs and verify important transformation theorems for probabilistic action systems.

show abstract

Section: Limitations Of the Algebramentioning

confidence: 85%