By Topic

On the algorithmic unsolvability of some stability problems for hybrid systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Toker, O. ; Coll. of Comput. Sci. & Eng., King Fahd Univ. of Pet. & Miner., Dhahran, Saudi Arabia

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

Published in:

Automatic Control, IEEE Transactions on  (Volume:45 ,  Issue: 1 )