Symbolic reachability computation of a class of Second-order systems

Ming Xu; Liangyu Chen; Zhi Bin Li

doi:10.1109/ICINFA.2009.5205124

Symbolic reachability computation of a class of Second-order systems

Ming Xu^*, Liangyu Chen, Zhi Bin Li

^*Corresponding author for this work

East China Normal University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Reachability is an important property of safety which widely analyzed in designing physical control systems. By contrast to issues related to stability and controllability of physical systems are well-studied in control theory, there are many results on reachability of those systems in computer science, but mainly for some trivial linear systems developed by formal methods and tools. In this paper, we present the first known family of second-order systems with the decidable symbolic computation problem of its reachable state space at the best of our knowledge. We extend the approach that reducing reachability computation into semi-algebraic system solving and analyzing the special type of second-order systems carefully. We also illustrate the application of our method by performing the Maple package DISCOVERER successfully.

Original language	English
Title of host publication	2009 IEEE International Conference on Information and Automation, ICIA 2009
Pages	1336-1339
Number of pages	4
DOIs	https://doi.org/10.1109/ICINFA.2009.5205124
State	Published - 2009
Event	2009 IEEE International Conference on Information and Automation, ICIA 2009 - Zhuhai, Macau, China Duration: 22 Jun 2009 → 25 Jun 2009

Publication series

Name	2009 IEEE International Conference on Information and Automation, ICIA 2009

Conference

Conference	2009 IEEE International Conference on Information and Automation, ICIA 2009
Country/Territory	China
City	Zhuhai, Macau
Period	22/06/09 → 25/06/09

Access to Document

10.1109/ICINFA.2009.5205124

Cite this

@inproceedings{5fe7d5009a09417faae377e0f098e037,

title = "Symbolic reachability computation of a class of Second-order systems",

abstract = "Reachability is an important property of safety which widely analyzed in designing physical control systems. By contrast to issues related to stability and controllability of physical systems are well-studied in control theory, there are many results on reachability of those systems in computer science, but mainly for some trivial linear systems developed by formal methods and tools. In this paper, we present the first known family of second-order systems with the decidable symbolic computation problem of its reachable state space at the best of our knowledge. We extend the approach that reducing reachability computation into semi-algebraic system solving and analyzing the special type of second-order systems carefully. We also illustrate the application of our method by performing the Maple package DISCOVERER successfully.",

author = "Ming Xu and Liangyu Chen and Li, \{Zhi Bin\}",

year = "2009",

doi = "10.1109/ICINFA.2009.5205124",

language = "英语",

isbn = "9781424436088",

series = "2009 IEEE International Conference on Information and Automation, ICIA 2009",

pages = "1336--1339",

booktitle = "2009 IEEE International Conference on Information and Automation, ICIA 2009",

note = "2009 IEEE International Conference on Information and Automation, ICIA 2009 ; Conference date: 22-06-2009 Through 25-06-2009",

}

Xu, M, Chen, L & Li, ZB 2009, Symbolic reachability computation of a class of Second-order systems. in 2009 IEEE International Conference on Information and Automation, ICIA 2009., 5205124, 2009 IEEE International Conference on Information and Automation, ICIA 2009, pp. 1336-1339, 2009 IEEE International Conference on Information and Automation, ICIA 2009, Zhuhai, Macau, China, 22/06/09. https://doi.org/10.1109/ICINFA.2009.5205124

Symbolic reachability computation of a class of Second-order systems. / Xu, Ming; Chen, Liangyu; Li, Zhi Bin.
2009 IEEE International Conference on Information and Automation, ICIA 2009. 2009. p. 1336-1339 5205124 (2009 IEEE International Conference on Information and Automation, ICIA 2009).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Symbolic reachability computation of a class of Second-order systems

AU - Xu, Ming

AU - Chen, Liangyu

AU - Li, Zhi Bin

PY - 2009

Y1 - 2009

N2 - Reachability is an important property of safety which widely analyzed in designing physical control systems. By contrast to issues related to stability and controllability of physical systems are well-studied in control theory, there are many results on reachability of those systems in computer science, but mainly for some trivial linear systems developed by formal methods and tools. In this paper, we present the first known family of second-order systems with the decidable symbolic computation problem of its reachable state space at the best of our knowledge. We extend the approach that reducing reachability computation into semi-algebraic system solving and analyzing the special type of second-order systems carefully. We also illustrate the application of our method by performing the Maple package DISCOVERER successfully.

AB - Reachability is an important property of safety which widely analyzed in designing physical control systems. By contrast to issues related to stability and controllability of physical systems are well-studied in control theory, there are many results on reachability of those systems in computer science, but mainly for some trivial linear systems developed by formal methods and tools. In this paper, we present the first known family of second-order systems with the decidable symbolic computation problem of its reachable state space at the best of our knowledge. We extend the approach that reducing reachability computation into semi-algebraic system solving and analyzing the special type of second-order systems carefully. We also illustrate the application of our method by performing the Maple package DISCOVERER successfully.

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

U2 - 10.1109/ICINFA.2009.5205124

DO - 10.1109/ICINFA.2009.5205124

M3 - 会议稿件

AN - SCOPUS:70449629844

SN - 9781424436088

T3 - 2009 IEEE International Conference on Information and Automation, ICIA 2009

SP - 1336

EP - 1339

BT - 2009 IEEE International Conference on Information and Automation, ICIA 2009

T2 - 2009 IEEE International Conference on Information and Automation, ICIA 2009

Y2 - 22 June 2009 through 25 June 2009

ER -

Symbolic reachability computation of a class of Second-order systems

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this