On the algorithmic unsolvability of some stability problems for hybrid systems

DOI10.1109/9.827377MaRDI QIDQ4507024zbMATH OpenOpenAlexFDO

Authors 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

asynchronous iterative processeshybrid systemsreachability problemsstability problemsunsolvability

Mathematics Subject Classification ID

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

Recommendations

• On the decidability of stability of hybrid systems
• On the hyperstability of a class of hybrid systems
• On the stability of a class of nonlinear hybrid systems
• On the stability of hybrid dynamical systems
• On the Reachability Problem for Uncertain Hybrid Systems
• Algebraic unsolvability of problem of absolute stability of desynchronized systems
• Algorithmic analysis of nonlinear hybrid systems
• A result on the hyperstability of a class of hybrid dynamic systems
• On the stability of hybrid homogeneous systems
• scientific article; zbMATH DE number 1956631

Cited in

(2)

• Algebraic unsolvability of problem of absolute stability of desynchronized systems
• Complexity of stability and controllability of elementary hybrid systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4507024)