Uniform reachability algorithms
A parametrized family of hybrid systems is considered. Using algebraic and topological methods, reachability is discussed. Next, tools from mathematical logic are used in the analysis of the computational questions associated with the reachability concept. The paper contains several definitions and concepts concerning hybrid control systems and certain topological properties of the families of hybrid control systems. Moreover, simple illustrative examples are also given. Finally, several remarks and comments on the algebraic and topological methods used in the paper are presented. Similar problems concerning hybrid control systems have been recently discussed in the paper [\textit{G. Lafferriere, G. Pappas} and \textit{S. Yovine}, Lect. Notes Comput. Sci. 1569, 137-151 (1999; Zbl 0926.93036)]. For the entire collection see [Zbl 0934.00029].
This page was built for publication: Uniform reachability algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953394)