Decidable Compositions of O-Minimal Automata

We identify a new class of decidable hybrid automata: namely, parallel compositions of semi-algebraic o-minimal automata. The class we consider is fundamental to hierarchical modeling in many exemplar systems, both natural and engineered. Unfortunately, parallel composition, which is an atomic operator in such constructions, does not preserve the decidability of reachability. Luckily, this paper is able to show that when one focuses on the composition of semi-algebraic o-minimal automata, it is possible to translate the decidability problem into a satisfiability problem over formul

• Type: Conference
• Year: 2008
• Where: ATVA
• Authors: Alberto Casagrande, Pietro Corvaja, Carla Piazza, Bud Mishra
• Keywords: ATVA 2008, Decidable Hybrid Automata, Hardware, Parallel Composition, Semi-algebraic O-minimal Automata