TY  - GEN
A1  - Mohammed, Ammar
A1  - Stolzenburg, Frieder
T1  - Using Constraint Logic Programming for Modeling and Verifying Hierarchical Hybrid Automata
N2  - Hybrid systems are the result of merging the two most commonly used models for dynamical systems, namely continuous dynamical systems defined by differential equations and discrete-event systems defined by automata. One can view hybrid systems as constrained systems, where the constraints describe the possible process flows, invariants within states, and transitions on the one hand, and to characterize certain parts of the state space (e.g. the set of initial states, or the set of unsafe states) on the other hand. Therefore, it is advantageous to use constraint logic programming (CLP) as an approach to model hybrid systems. In this paper, we provide CLP implementations, that model hybrid systems comprising several concurrent hybrid automata, whose size is only straight proportional to the size of the given system description. Furthermore, we allow different levels of abstraction by making use of hierarchies as in UML statecharts. In consequence, the CLP model can be used for analyzing and testing the absence or existence of (un)wanted behaviors in hybrid systems. Thus in summary, we get a procedure for the formal verification of hybrid systems by model checking, employing logic programming with constraints.
T3  - Arbeitsberichte, FB Informatik - 2009,6 
KW  - hybrid systems
KW  - constraint logic programming
Y1  - 2009
UR  - https://kola.opus.hbz-nrw.de/frontdoor/index/index/docId/309
UR  - https://nbn-resolving.org/urn:nbn:de:kola-3093
ER  -