Symbolic Reachability Computation of A Class of Nonlinear Systems

被引:1
|
作者
Xu, Ming [1 ]
Chen, Liangyu [1 ]
Li, Zhi-bin [1 ]
机构
[1] E China Normal Univ, Shanghai Key Lab Trustworthy Comp, Shanghai 200062, Peoples R China
关键词
D O I
10.1109/ICIS.2009.146
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Reachability is recognized as a key problem in designing physical control systems (most are nonlinear systems) in formal method community. Issues related to stability and controllability of physical systems are well studied in control theory. However there are not many results on reachability of those systems and fewer on nonlinear systems in computer science yet. In this paper we present the first known family of nonlinear systems with the decidable symbolic computation problem of their reachable state spaces at the best of our knowledge. This is approached by reducing reachability computation to semi-algebraic system solving. Furthermore we illustrate the application of our method by performing the Maple package DISCOVERER.
引用
收藏
页码:706 / 710
页数:5
相关论文
共 50 条