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
来源：
PROCEEDINGS OF THE 8TH IEEE/ACIS INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE | 2009年
关键词：
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 条
  • [21] Symbolic reachability analysis of multirate hybrid systems
    Zhang, Haibin
    Duan, Zhenhua
    Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University, 2007, 41 (04): : 412 - 415
  • [22] Reachability of a class of hybrid systems
    Wang, YJ
    Xie, GM
    Nang, L
    2003 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOLS 1-5, CONFERENCE PROCEEDINGS, 2003, : 312 - 316
  • [23] Symbolic computation as a tool to identify controllability problems of nonlinear chemical systems
    Kuhlmann, A
    Bogle, D
    1996 ICHEME RESEARCH EVENT - SECOND EUROPEAN CONFERENCE FOR YOUNG RESEARCHERS IN CHEMICAL ENGINEERING, VOLS 1 AND 2, 1996, : 805 - 807
  • [24] An approach to class reasoning in symbolic computation
    Cioni, G
    Colagrossi, A
    Temperini, M
    DESIGN AND IMPLEMENTATION OF SYMBOLIC COMPUTATION SYSTEMS, 1996, 1128 : 240 - 251
  • [25] Achieving speedups in distributed symbolic reachability analysis through asynchronous computation
    Grumberg, O
    Heyman, T
    Ifergan, N
    Schuster, A
    CORRECT HARDWARE DESIGN AND VERIFICATION METHODS, PROCEEDINGS, 2005, 3725 : 129 - 145
  • [26] SYMBOLIC COMPUTATION APPROACH TO NONLINEAR DYNAMICS
    BAJER, J
    LISONEK, P
    JOURNAL OF MODERN OPTICS, 1991, 38 (04) : 719 - 729
  • [27] REACHABILITY FOR A CLASS OF NONLINEAR DISTRIBUTED SYSTEMS GOVERNED BY PARABOLIC VARIATIONAL-INEQUALITIES
    ZHAO, Y
    HUANG, Y
    CHAN, WL
    LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1991, 159 : 196 - 202
  • [28] Decomposition of generalized frequency response functions for nonlinear systems using symbolic computation
    Billings, SA
    Yusof, MI
    INTERNATIONAL JOURNAL OF CONTROL, 1996, 65 (04) : 589 - 618
  • [29] Decomposition of generalized frequency response functions for nonlinear systems using symbolic computation
    Univ of Sheffield, Sheffield, United Kingdom
    Int J Control, 4 (589-618):
  • [30] Symbolic computation for nonlinear systems using quotients over skew polynomial ring
    Halas, Miroslav
    Huba, Mikulas
    PROCEEDINGS OF 2006 MEDITERRANEAN CONFERENCE ON CONTROL AND AUTOMATION, VOLS 1 AND 2, 2006, : 1002 - +
12345