A UTP semantics of pGCL as a homogeneous relation

dc.contributor.author	Bresciani, Riccardo
dc.contributor.author	Butterfield, Andrew
dc.date.accessioned	2012-10-15T08:47:21Z
dc.date.available	2012-10-15T08:47:21Z
dc.date.issued	2012
dc.identifier.uri	http://hdl.handle.net/10344/2607
dc.description	peer-reviewed	en_US
dc.description.abstract	We present an encoding of the semantics of the probabilis- tic 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 predi- cates capture the same information as the models traditionally used to give semantics to pGCL; in addition our formulation allows us to de- ne a generic choice construct, that covers conditional, probabilistic and non-deterministic choice. As an example we study the Monty Hall game in this framework.	en_US
dc.language.iso	eng	en_US
dc.publisher	Springer	en_US
dc.relation.ispartofseries	Integrated Formal Methods 2012. Lecture Notes in Computer Science;7321, pp. 191-205
dc.relation.uri	http://dx.doi.org/10.1007/978-3-642-30729-4_14
dc.rights	The original publication is available at www.springerlink.com	en_US
dc.subject	unifying themes of programming	en_US
dc.subject	UTP	en_US
dc.subject	programming techniques	en_US
dc.title	A UTP semantics of pGCL as a homogeneous relation	en_US
dc.type	info:eu-repo/semantics/conferenceObject	en_US
dc.type.supercollection	all_ul_research	en_US
dc.type.supercollection	ul_published_reviewed	en_US
dc.contributor.sponsor	SFI	en_US
dc.relation.projectid	08/RFP/CMS1277	en_US
dc.relation.projectid	03/CE2/I303_1	en_US
dc.rights.accessrights	info:eu-repo/semantics/openAccess	en_US