On the algorithmic unsolvability of some stability problems for hybrid systems

Onur Toker · IEEE Transactions on Automatic Control · 2000

We define two stability problems for a class of hybrid systems containing asynchronous iterative processes and prove these problems are algorithmically unsolvable. Furthermore, we also show some reachability problems for asynchronous iterative processes are algorithmically unsolvable.

Read the paper · More papers on PaperTik