[2I5-OS-9b] AIと制約プログラミング

[2I5-OS-9b-05] Constraint-based and automata-based representations for the modeling of hybrid systems

Kunihiro Hata¹, 〇Kazunori Ueda¹ (1. Waseda University)

Keywords:Constraint programming, Hybrid systems, Constraint hierarchy, Modeling of time

Hybrid systems are systems that involve both continuous and discrete changes,which can express dynamical systems, circuits, control systems, and so on. Hybrid automata (HA)are mainly used for modeling hybrid systems, and model checking methods based on themhave been well-studied. However, there are some non-trivial points in expressing hybridsystems as hybrid automata precisely.HydLa is a hybrid systems modeling language that enables us to write systems' specificationsconcisely using constraint programming and constraint hierarchy. A declarative semantics is given for HydLa, and bounded model checking is featured by its implementation. On the other hand, in order to check properties that hold after an unbounded number of discrete changes, it is necessary to extend the existing definition of HydLa's hybrid trajectories.In this paper, we defined HydLa HA in order to verify models written in a subset of HydLa in an existing framework of hybrid automata. In the definition, open intervals are adoptedfor time structure in hybrid trajectory, whereas closed intervals are adopted in generalhybrid automata. We examined the definition by some examples.