On the algorithmic unsolvability of some stability problems for hybrid systems
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)
The author considers a class of hybrid systems containing asynchronous iterative processes described by \[ x(k+1)= A_{f(u(k), y(k))}x (k) \tag{1} \] where \(f(u(k),y(k))\) is a discrete function, \(f:\{-1,+1\} \times\{-1,+1\} \to\{1,2,3,4\}\), \(y(k)=\text{sign}(a^Tx(k))\), \(A_1,A_2,A_3,A_4\) are rational matrices, \(a\) is a rational vector. The author defines two reachability problems and two stability problems for system (1) and shows that these problems are algorithmically unsolvable.
- 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
- Approximate stabilisation of uncertain 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)