In this paper we present an approach to model concurrent systems specified in a temporal concurrent constraint language, which is able to model Hybrid Systems. We construct a framework in which it is possible to apply the Model Checking technique to programs specified in such language.
We present a formalism to transform correctly specification into a Hybrid cc Structure. This structure represents the program behavior by a graph.
Our basic tool is the Hybrid Concurrent Constraint Programming (hybrid cc) framework defined by Saraswat et al. to describe hybrid systems which have a continuous behavior over time but with a discrete control. With this language we take advantage of both the natural properties of the declarative paradigm and of the fact that the notion of continuous time is built into the semantics of the programming language. Following this approach it becomes reasonable to introduce the idea of applying the technique of Model Checking to a finite time interval (introduced by the user). With this restriction we naturally force the space representing the behavior of the program to be finite and hence efficient Model Checking algorithms to be applicable. More specifically, we present an automatic transformation from Hybrid cc Structures to linear hybrid automata, and thus we can use standard model checkers working on timed automata, such as HyTech, in order to verify properties of hybrid systems.