TY - CONF
AB - Rectangular automata are well suited for approximate modeling of continuous-discrete systems. The exact analysis of these automata is feasible for small examples but can encounter severe numerical problems for even medium-sized systems. This paper presents an analysis algorithm that uses conservative overapproximation to avoid these numerical problems. The algorithm is demonstrated on a simple benchmark system consisting of two connected tanks.
Supported by the German Research Council (DFG) under grant Ko1430/3 in the special program KONDISK (‘Continuous-discrete dynamics of technical systems’).
AU - Preußig, Jörg
AU - Kowalewski, Stefan
AU - Wong-Toi, Howard
AU - Thomas Henzinger
ID - 4410
TI - An algorithm for the approximative analysis of rectangular automata
VL - 1486
ER -