Paper Info
Title
Symbolic Reachability Computation of a Class of Nonlinear Systems
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 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.
Year
DOI
Venue
2009
10.1109/ICIS.2009.146
ACIS-ICIS
Keywords
Field
DocType
nonlinear systems,maple package,decidable symbolic computation problem,physical control system,key problem,reachability computation,physical system,control theory,nonlinear system,symbolic reachability computation,computer science,formal method community,automata,data mining,algebra,formal method,control systems,polynomials,state space,control system,controllability,packaging,stability,application software,symbolic computation
Nonlinear system,Controllability,Computer science,Physical system,Symbolic computation,Decidability,Theoretical computer science,Reachability,Formal methods,Computation
Conference
Citations 
PageRank 
References 
0
0.34
10
Authors
3
Name
Order
Citations
PageRank
Ming Xu100.34
Liangyu Chen2163.79
Zhibin Li311523.77