Uniform reachability algorithms (Q4953394)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1444353
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Uniform reachability algorithms |
scientific article; zbMATH DE number 1444353 |
Statements
2 January 2001
0 references
computational methods
0 references
hybrid systems
0 references
reachability
0 references
0.7704216837882996
0 references
0.7590705752372742
0 references
0.7582545876502991
0 references
0.7489325404167175
0 references
0.7471439838409424
0 references
Uniform reachability algorithms (English)
0 references
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].
0 references