Ye, Kangfeng, Foster, Simon orcid.org/0000-0002-9889-9514 and Woodcock, Jim orcid.org/0000-0001-7955-2702 (2022) Formally Verified Animation for RoboChart Using Interaction Trees. In: Riesco, Adrian and Zhang, Min, (eds.) Formal Methods and Software Engineering - 23rd International Conference on Formal Engineering Methods, ICFEM 2022, Proceedings. 23rd International Conference on Formal Engineering Methods, ICFEM 2022, 24-27 Oct 2022 Lecture Notes in Computer Science . Springer , ESP , pp. 404-420.
Abstract
RoboChart is a core notation in the RoboStar framework. It is a timed and probabilistic domain-specific and state machine based language for robotics. RoboChart supports shared variables and communication across entities in its component model. It has a formal denotational semantics given in CSP. Interaction Trees (ITrees) is a semantic technique to represent behaviours of reactive and concurrent programs interacting with their environments. Recent mechanisations of ITrees along with ITree-based CSP semantics and a Z mathematical toolkit in Isabelle/HOL bring new applications of verification and animation for state-rich process languages, such as RoboChart. In this paper, we use ITrees to give RoboChart a novel operational semantics, implement it in Isabelle, and use Isabelle’s code generator to generate verified and executable animations. We illustrate our approach using an autonomous chemical detector model. With animation, we show two concrete scenarios when the robot encounters different environmental inputs.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | This work is funded by the EPSRC projects CyPhyAssure (Grant EP/S001190/1), RoboCalc (Grant EP/M025756/1), and RoboTest (Grant EP/R025479/1). The icons used in RoboChart have been made by Sarfraz Shoukat, Freepik, Google, Icomoon and Madebyoliver from www.flaticon. com, and are licensed under CC 3.0 BY. © Springer Nature Switzerland AG 2022. This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details |
Keywords: | Interaction Trees,CSP,Theorem proving,RoboChart,Code Generation,Robotic software,Operational 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/S001190/1 EPSRC EP/R025479/1 |
Depositing User: | Pure (York) |
Date Deposited: | 29 Jun 2022 16:10 |
Last Modified: | 08 Jan 2025 00:17 |
Published Version: | https://doi.org/10.1007/978-3-031-17244-1_24 |
Status: | Published |
Publisher: | Springer |
Series Name: | Lecture Notes in Computer Science |
Identification Number: | 10.1007/978-3-031-17244-1_24 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:188566 |
Download
Filename: Animation_of_RoboChart_with_interaction_trees_20220407_ICFEM2022.pdf
Description: Animation of RoboChart with interaction trees (20220407) - ICFEM2022