A Proof System for HRML with Extended Hoare Logic

Hybrid systems are composed of physical components with continuous variables and discrete control components. Over time, the interacting laws of discrete and continuous dynamics manage the transition of states in hybrid systems. The operation of hybrid systems needs the combinations of computation and control. However, those combinations add the complexity of the system design and modelling. Therefore, a hybrid relational modelling language (HRML) was proposed to capture the features of hybrid systems.In this paper, we formulate a proof system for HRML to prove the correctness of hybrid systems. In our proof system, the specification and verification are based on Hoare Logic. To express the timing of observable actions, we extend the classical assertion language by adding primitives to it. Both terminating and non-terminating computations can be described in our proof system. In addition, some detailed examples are given to illustrate the application of our proof system.