Formally verified animation for RoboChart using interaction trees

TY - JOUR

T1 - Formally verified animation for RoboChart using interaction trees

AU - Ye, Kangfeng

AU - Foster, Simon

AU - Woodcock, Jim

N1 - © 2023 The Author(s). Funding Information: This work is funded by the EPSRC projects CyPhyAssure 14 14 (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 https://www.flaticon.com and are licensed under CC 3.0 BY. Funding Information: This document presents results from the research project CyPhyAssure ( https://www.cs.york.ac.uk/circus/CyPhyAssure/ , Grant EP/S001190/1 ) funded by EPSRC .

PY - 2024/2

Y1 - 2024/2

N2 - 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 formal denotational semantics given in CSP. The semantic technique of Interaction Trees (ITrees) represents behaviours of reactive and concurrent programs interacting with their environments. Recent mechanisation of ITrees, 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 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 and patrol robot models, exhibiting nondeterminism and using shared variables. With animation, we show two concrete scenarios for the chemical detector when the robot encounters different environmental inputs and three for the patrol robot when its calibrated position is in other corridor sections. We also verify that the animated scenarios are trace refinements of the CSP denotational semantics of the RoboChart models using FDR, a refinement model checker for CSP. This ensures that our approach to resolve nondeterminism using CSP operators with priority is sound and correct.

AB - 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 formal denotational semantics given in CSP. The semantic technique of Interaction Trees (ITrees) represents behaviours of reactive and concurrent programs interacting with their environments. Recent mechanisation of ITrees, 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 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 and patrol robot models, exhibiting nondeterminism and using shared variables. With animation, we show two concrete scenarios for the chemical detector when the robot encounters different environmental inputs and three for the patrol robot when its calibrated position is in other corridor sections. We also verify that the animated scenarios are trace refinements of the CSP denotational semantics of the RoboChart models using FDR, a refinement model checker for CSP. This ensures that our approach to resolve nondeterminism using CSP operators with priority is sound and correct.

KW - Animation of robot software

KW - Code generation

KW - CSP

KW - Interaction trees

KW - Operational semantics

KW - Theorem proving

UR - http://www.scopus.com/inward/record.url?scp=85181131395&partnerID=8YFLogxK

U2 - 10.1016/j.jlamp.2023.100940

DO - 10.1016/j.jlamp.2023.100940

M3 - Article

AN - SCOPUS:85181131395

SN - 2352-2208

VL - 137

JO - Journal of Logical and Algebraic Methods in Programming

JF - Journal of Logical and Algebraic Methods in Programming

M1 - 100940

ER -