Woodcock, JAMES Charles Paul orcid.org/0000-0001-7955-2702, Cavalcanti, Ana Lucia Caneca orcid.org/0000-0002-0831-1976, Foster, Simon David orcid.org/0000-0002-9889-9514 et al. (1 more author) (2019) Probabilistic Semantics for RoboChart A Weakest Completion Approach. In: Ribeiro, Pedro and Sampaio, Augusto, (eds.) Unifying Theories of Programming:7th International Symposium, UTP 2019, Dedicated to Tony Hoare on the Occasion of His 85th Birthday, Porto, Portugal, October 8, 2019, Proceedings. Lecture Notes in Computer Science . Springer
Abstract
We outline a probabilistic denotational semantics for the RoboChart language, a diagrammatic, domain-specific notation for de- scribing robotic controllers with their hardware platforms and operating environments. We do this using a powerful (but perhaps not so well known) semantic technique: He, Morgan, and McIver’s weakest completion semantics, which is based on Hoare and He’s Unifying Theories of Programming. In this approach, we do the following: (1) start with the standard semantics for a nondeterministic programming language; (2) propose a new probabilistic semantic domain; (3) propose a forgetful function from the probabilistic semantic domain to the standard semantic domain; (4) use the converse of the forgetful function to embed the standard semantic domain in the probabilistic semantic domain; (5) demonstrate that this embedding preserves program structure; (6) define the probabilistic choice operator. Weakest completion semantics guides the semantic definition of new languages by building on existing semantics and, in this case, tackling a notoriously thorny issue: the relationship between demonic and probabilistic choice. Consistency ensures that programming intuitions, development techniques, and proof methods can be carried over from the standard language to the probabilistic one. We largely follow He et al., our contribution being an explication of the technique with meticulous proofs suitable for mechanisation in Isabelle/UTP.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Keywords: | RoboChart language,Robotic controllers,Statecharts,Probabilistic semantics,Relational calculus,Unifying Theories of Programming (UTP),Weakest completion semantics |
Dates: |
|
Institution: | The University of York |
Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
Funding Information: | Funder Grant number EPSRC EP/M025756/1 THE ROYAL SOCIETY IEC\NSFC\170319 |
Depositing User: | Pure (York) |
Date Deposited: | 10 Sep 2019 11:30 |
Last Modified: | 02 Apr 2025 23:33 |
Status: | Published |
Publisher: | Springer |
Series Name: | Lecture Notes in Computer Science |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:150601 |
Download
Filename: probabilistic_semantics_for_robochart.pdf
Description: probabilistic-semantics-for-robochart