Refinement Checking for Multirate Hybrid ZIA

A hybrid system is a dynamical system with both discrete and continuous components. In order to study the modeling and verification aspects of hybrid system, in this paper we first introduce a specification approach combining interface automata, initialized multirate hybrid automata and Z language, which is named MZIA. Meanwhile we propose a refinement relation on MZIAs. Then we give an algorithm for checking refinement relation between MZIAs with finite domain and demonstrate the correctness of the algorithm.

[1]  Hui Wang,et al.  Hybrid ZIA and its Approximated Refinement Relation , 2011, ENASE.

[2]  J. Michael Spivey,et al.  The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.

[3]  Hui Wang,et al.  Extending Interface Automata with Z Notation , 2011, FSEN.

[4]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[5]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.