Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
