Relating Hybrid Chi to other formalisms

The hybrid @g (Chi) formalism is suited to modeling, simulation and verification of hybrid systems. It integrates concepts from dynamics and control theory with concepts from computer science, in particular from process algebra and hybrid automata. In this paper, we first provide an overview of @g. Then, the @g formalism is related to other formalisms by means of translation schemes: a translation scheme from continuous-time PWA systems to @g, a translation scheme from discrete-time PWA systems to @g, and a translation scheme from hybrid automata to @g. In order to be able to use existing model checkers that use hybrid automata like input languages, we developed and implemented a translation scheme from a subset of @g to hybrid automata. To illustrate this approach, a case study has been performed: a water level monitor has been modeled using @g. Using the implemented translation scheme from @g to hybrid automata, we obtain a hybrid automata model for the water level monitor. From this model, code that can be used as input for the model checker PHAVer is generated.