Analysis of Hybrid systems in CLP($\mathcal{R}$)

Abstract

This paper presents the formalization of the symbolic simulation and analysis technique for hybrid systems developed in [9, 7, 8]. The main advantage of this technique is the close relation between the hybrid-systems model Hybrid Automata [1, 8] and the execution model CLP($\mathcal{R}$) [3]. Our rule-based description is naturally suited for hybrid systems allowing (a) to lift CLP($\mathcal{R}$) definitions and results for the theory of hybrid systems, and therefore (b) to apply — in addition to forward/backward fixpoint computation and symbolic model-checking — CLP($\mathcal{R}$) intelligent search and backtracking procedures [2] in their analysis, since the depth-first search strategy of CLP($\mathcal{R}$) is incomplete on infinite trees. These techniques were implemented in part on top of the CLP($\mathcal{R}$) prototype system [4]. We illustrate our method with a variant of the reactor temperature control system from [1]. More realistic examples can be found in [9, 7, 8, 6].