Hybrid ZIA and its Approximated Refinement Relation

In this paper, we propose a specification model combining interface automata, hybrid automata and Z language, named HZIA. This model can be used to describe temporal properties, hybrid properties, and data properties of hybrid software/hardware components. We also study the approximated refinement relation on

[1]  Jim Woodcock,et al.  Using Z - specification, refinement, and proof , 1996, Prentice Hall international series in computer science.

[2]  Thomas A. Henzinger,et al.  Interface automata , 2001, ESEC/FSE-9.

[3]  Jonathan P. Bowen.  Formal Specification and Documentation Using Z: A Case Study Approach , 1996 .

[4]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

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

[6]  Clemens Fischer.  CSP-OZ: a combination of object-Z and CSP , 1997 .

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

[8]  Clemens Fischer,et al.  How to Combine Z with Process Algebra , 1998, ZUM.

[9]  Zining Cao.  Refinement Checking for Interface Automata with Z Notation , 2010, SEKE.