跳到主要导航 跳到搜索 跳到主要内容

Symbolic reachability computation of a class of Second-order systems

  • Ming Xu*
  • , Liangyu Chen
  • , Zhi Bin Li
  • *此作品的通讯作者
  • East China Normal University

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

摘要

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.

源语言英语
主期刊名2009 IEEE International Conference on Information and Automation, ICIA 2009
页1336-1339
页数4
DOI
出版状态已出版 - 2009
活动2009 IEEE International Conference on Information and Automation, ICIA 2009 - Zhuhai, Macau, 中国
期限: 22 6月 2009 → 25 6月 2009

丛书

姓名2009 IEEE International Conference on Information and Automation, ICIA 2009

会议

会议2009 IEEE International Conference on Information and Automation, ICIA 2009
国家/地区中国
市Zhuhai, Macau
时期22/06/09 → 25/06/09

学术指纹

探究 'Symbolic reachability computation of a class of Second-order systems' 的科研主题。它们共同构成独一无二的学术指纹。

引用此