On the algorithmic unsolvability of some stability problems for hybrid systems

Onur Toker

doi:10.1109/9.827377

On the algorithmic unsolvability of some stability problems for hybrid systems

Onur Toker

King Fahd University of Petroleum & Minerals

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

In this paper, 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.

Original language	English
Pages (from-to)	165-168
Number of pages	4
Journal	IEEE Transactions on Automatic Control
Volume	45
Issue number	1
DOIs	https://doi.org/10.1109/9.827377
State	Published - 2000

Bibliographical note

Funding Information:
Manuscript received October 4, 1996; revised February 20, 1999. Recommended by Associate Editor, K. Rudie. This work was supported by KFUPM. The author is with the College of Computer Science and Engineering, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia (e-mail: [email protected]). Publisher Item Identifier S 0018-9286(00)01928-0.

ASJC Scopus subject areas

Control and Systems Engineering
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/9.827377

Cite this

@article{01b5034e57f14c28a22e3aca62286b04,

title = "On the algorithmic unsolvability of some stability problems for hybrid systems",

abstract = "In this paper, 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.",

author = "Onur Toker",

note = "Funding Information: Manuscript received October 4, 1996; revised February 20, 1999. Recommended by Associate Editor, K. Rudie. This work was supported by KFUPM. The author is with the College of Computer Science and Engineering, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia (e-mail: [email protected]). Publisher Item Identifier S 0018-9286(00)01928-0.",

year = "2000",

doi = "10.1109/9.827377",

language = "English",

volume = "45",

pages = "165--168",

journal = "IEEE Transactions on Automatic Control",

issn = "0018-9286",

number = "1",

}

TY - JOUR

T1 - On the algorithmic unsolvability of some stability problems for hybrid systems

AU - Toker, Onur

N1 - Funding Information: Manuscript received October 4, 1996; revised February 20, 1999. Recommended by Associate Editor, K. Rudie. This work was supported by KFUPM. The author is with the College of Computer Science and Engineering, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia (e-mail: [email protected]). Publisher Item Identifier S 0018-9286(00)01928-0.

PY - 2000

Y1 - 2000

N2 - In this paper, 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.

AB - In this paper, 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.

UR - https://www.scopus.com/pages/publications/0033876224

U2 - 10.1109/9.827377

DO - 10.1109/9.827377

M3 - Article

AN - SCOPUS:0033876224

SN - 0018-9286

VL - 45

SP - 165

EP - 168

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

IS - 1

ER -

On the algorithmic unsolvability of some stability problems for hybrid systems

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this