Title :
Symbolic Reachability Computation of a Class of Nonlinear Systems
Author :
Xu, Ming ; Chen, Langyu ; Li, Zhi-Bin
Author_Institution :
Shanghai Key Lab. of Trustworthy Comput., East China Normal Univ., Shanghai, China
Abstract :
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 is 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.
Keywords :
control system synthesis; controllability; nonlinear control systems; reachability analysis; stability; symbol manipulation; computer science; control theory; nonlinear system; physical control system design; physical system controllability; semialgebraic system solving; stability; symbolic reachability computation; Application software; Computer science; Control systems; Control theory; Controllability; Nonlinear control systems; Nonlinear systems; Packaging; Stability; State-space methods; DISCOVERER; Nonlinear Systems; Reachability Analysis; Semi-algebraic System;
Conference_Titel :
Computer and Information Science, 2009. ICIS 2009. Eighth IEEE/ACIS International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-0-7695-3641-5
DOI :
10.1109/ICIS.2009.146
