Probabilistic Choice in Refinement Algebra

DOI10.1007/978-3-540-70594-9_14zbMath1156.68357OpenAlexW1530002803MaRDI QIDQ3521991

Ian J. Hayes, Larissa A. Meinicke

Publication date: 28 August 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70594-9_14

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Abstract representation theorems for demonic refinement algebras ⋮ Refinement algebra for probabilistic programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic reasoning for probabilistic action systems and while-loops
• Towards a refinement algebra
• Reactive Probabilistic Programs and Refinement Algebra
• Refinement Algebra with Operators for Enabledness and Termination
• Abstraction, Refinement and Proof for Probabilistic Systems
• Kleene algebra with domain
• Mathematics of Program Construction
• On Two Dually Nondeterministic Refinement Algebras

This page was built for publication: Probabilistic Choice in Refinement Algebra