On the algorithmic unsolvability of some stability problems for hybrid systems

From MaRDI portal





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.











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)