On the algorithmic unsolvability of some stability problems for hybrid systems

DOI10.1109/9.827377zbMath0983.93031OpenAlexW2163375552MaRDI QIDQ4507024

Onur Toker

Publication date: 17 October 2000

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4ae1560b25780821f5f9dbecfe47b94a2f516f16

zbMATH Keywords

hybrid systemsunsolvabilitystability problemsreachability problemsasynchronous iterative processes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Attainable sets, reachability (93B03) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

This page was built for publication: On the algorithmic unsolvability of some stability problems for hybrid systems