Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Probabilistic models for the guarded command language
Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
Towards a Time Model for Circus
ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction and refinement in probabilistic systems
ACM SIGMETRICS Performance Evaluation Review
POSIX and the Verification Grand Challenge: A Roadmap
ICECCS '08 Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems
Formal Aspects of Computing
The Denotational Semantics of slotted-Circus
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Unifying Probability with Nondeterminism
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Reasoning about a distributed probabilistic system
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
A probabilistic BPEL-like language
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
| Hi-index | 0.00 |
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.