Formally verified animation for RoboChart using interaction trees

Research output: Contribution to journalArticlepeer-review


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.
Original languageEnglish
Article number100940
Number of pages36
JournalJournal of Logical and Algebraic Methods in Programming
Early online date28 Dec 2023
Publication statusPublished - 1 Feb 2024

Bibliographical note

© 2023 The Author(s).


  • Interaction Trees
  • CSP
  • Operational semantics
  • Animation of robot software
  • Theorem proving
  • Code generation

Cite this