Model checking for a hybrid process algebra

Hybrid models capture both the continuous evolution of variables and discrete updates. Two distinct modelling approaches exist: hybrid process algebras focused on compositional verification, and hybrid automata focused on model checking. In this paper, we present an approach to translate processes written using a hybrid process algebra for refinement, CyPhyCircus, to networks of hybrid automata suitable as input for a model checker, CORA. In this way, we avoid development of a new tool, but provide support for model checking CyPhyCircus processes while retaining a compositional model. We illustrate our approach, using three models for robotic systems and their verification via reachability analysis using CORA. To the best of our knowledge, what we present here is the first approach to model checking hybrid process algebra.