(2000) On the algorithmic unsolvability of some stability problems forhybrid systems. Automatic Control, IEEE Transactions on, 45.

Preview	PDF 14227_1.pdf Download (17kB) | Preview
	Microsoft Word 14227_2.doc Download (26kB)

Abstract

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

Item Type:	Article
Subjects:	Computer
Department:	College of Computing and Mathematics > lndustrial and Systems Engineering
Depositing User:	Mr. Admin Admin
Date Deposited:	24 Jun 2008 13:27
Last Modified:	01 Nov 2019 14:04
URI:	http://eprints.kfupm.edu.sa/id/eprint/14227