Composing semi-algebraic O-minimal automata

摘要: This paper addresses questions regarding the decidability of hybrid automata that may be constructed hierarchically and in a modular way, as is case many exemplar systems, it natural or engineered. Since an important step such constructions product operation, which constructs new automaton by combining two simpler component automata, essential property would desired reachability decidable, provided belong to suitably restricted family automata. Somewhat surprisingly, operation does not assure closure for problem. Nonetheless, this establishes condition over are obtained composing semi-algebraic o-minimal systems. The class even closed under composition, i.e., necessarily automaton. However, we can prove our result both formulae reals linear Diophantine equations. All proofs results presented found [1].