Reasoning Algebraically About Probabilistic Loops
Back and von Wright have developed algebraic laws for reasoning about loops in the refinement calculus. We extend their work to reasoning about probabilistic loops in the probabilistic refinement calculus. We apply our algebraic reasoning to derive transformation rules for probabilistic action systems. In particular we focus on developing data refinement rules for probabilistic action systems. Our extension is interesting since some well known transformation rules that are applicable to standard programs are not applicable to probabilistic ones: we identify some of these important differences and we develop alternative rules where possible. In particular, our probabilistic action system data refinement rules are new.
KeywordsTransformation Rule Complete Lattice Probabilistic Program Reasoning Algebraically Predicate Transformer
Unable to display preview. Download preview PDF.
- 3.Back, R.J.R., Kurki-Suonio, R.: Decentralization of process nets with centralized control. In: Proc. of the 2nd ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, pp. 131–142. ACM Press, New York (1983)Google Scholar
- 6.Cohen, E.: Hypotheses in Kleene algebra. Technical Report TM-ARH-023814, Belcore (1994)Google Scholar
- 16.Sere, K., Troubitsyna, E.: Probabilities in action systems. In: Proc. of the 8th Nordic Workshop on Programming Theory (1996)Google Scholar
- 18.Troubitsyna, E.A.: Reliability assessment through probabilistic refinement. Nordic Journal of Computing, 320–342 (1999)Google Scholar
- 20.von Wright, J.: Towards a refinement algebra. Science of Computer Programming 51 (2004)Google Scholar