A UTP Semantics of pGCL as a Homogeneous Relation
- Cite this paper as:
- Bresciani R., Butterfield A. (2012) A UTP Semantics of pGCL as a Homogeneous Relation. In: Derrick J., Gnesi S., Latella D., Treharne H. (eds) Integrated Formal Methods. IFM 2012. Lecture Notes in Computer Science, vol 7321. Springer, Berlin, Heidelberg
We present an encoding of the semantics of the probabilistic guarded command language (pGCL) in the Unifying Theories of Programming (UTP) framework. Our contribution is a UTP encoding that captures pGCL programs as predicate-transformers, on predicates over probability distributions on before- and after-states: these predicates capture the same information as the models traditionally used to give semantics to pGCL; in addition our formulation allows us to define a generic choice construct, that covers conditional, probabilistic and non-deterministic choice. As an example we study the Monty Hall game in this framework.
Unable to display preview. Download preview PDF.