Reduction of timed hybrid systems
S. Di Gennaro, C.S. Horn, Sanjeev R. Kulkarni, Peter J. Ramadge · 2002
We consider a class of hybrid dynamic systems composed of interacting discrete and continuous subsystems. Of particular interest is the reduction of the coupled system to a single finite state automaton. Such a reduction has been proposed and analyzed in the literature on computer verification for certain special hybrid systems called timed automata. We use timed automata with two clocks (integrators) as a tool to explore extensions and generalizations of the reduction constructions. Several interesting new classes of reductions are presented.>