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 the case in many exemplar systems, be it natural or engineered. Since the basic fundamental step in such constructions is a product operation, an essential property that would be desired is that the reachability property of the product hybrid automaton be decidable, provided that the component hybrid automata belong to a suitably restricted family of automata. Somewhat surprisingly, the product operation does not assure a closure of decidability for the reachability problem. Nonetheless, this paper establishes the decidability of the reachability condition over automata which are obtained by synchronizing two semi-algebraic o-minimal systems.

• Type: Conference
• Year: 2007
• Where: HYBRID
• Authors: Alberto Casagrande, Pietro Corvaja, Carla Piazza, Bud Mishra
• Keywords: HYBRID 2007, Hybrid Automata, Hybrid Systems, Product Hybrid Automaton, Reachability