Probabilistic Choice in Refinement Algebra
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 194642 (Why is no real title available?)
- scientific article; zbMATH DE number 2090029 (Why is no real title available?)
- Abstraction, Refinement and Proof for Probabilistic Systems
- Algebraic reasoning for probabilistic action systems and while-loops
- Kleene algebra with domain
- Mathematics of Program Construction
- On Two Dually Nondeterministic Refinement Algebras
- Reactive Probabilistic Programs and Refinement Algebra
- Refinement Algebra with Operators for Enabledness and Termination
- Towards a refinement algebra
Cited in
(7)- Reactive Probabilistic Programs and Refinement Algebra
- Refinement Algebra with Operators for Enabledness and Termination
- Abstract representation theorems for demonic refinement algebras
- Refinement algebra for probabilistic programs
- Processes and formalisms for unbounded choice
- Encoding and decoding in refinement algebra
- Algebraic reasoning for probabilistic action systems and while-loops
This page was built for publication: Probabilistic Choice in Refinement Algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521991)