.png){kind=icon}
.png){kind=icon}
Return
Reachability Analysis for Solvable Dynamical Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2017.2763785.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The reachability problem is one of the most important issues in the verification of hybrid systems. But unfortunately the reachable sets for most of hybrid systems are not computable. In the literature, only some special families of linear vector fields are proved with decidable reachability problem, let alone nonlinear ones. In this paper, we investigate the reachability problem of nonlinear vector fields by identifying three families of nonlinear vector fields with solvability and prove that their reachability problems are decidable. An n-dimension dynamical system is called solvable if its state variables can be partitioned into m groups such that the derivatives of the variables in the ith group are linear in themselves, but possibly nonlinear in the variables from the 1st to i - 1th groups. The three families of nonlinear solvable vector fields under consideration are: the matrices corresponding to the linear parts of any vector field in the first family are nilpotent; the matrices corresponding to the linear parts of any vector in the second family are only with real eigenvalues; the matrices corresponding to the linear parts of any vector field in the third family are only with pure imaginary eigenvalues. The experimental results indicate the efficiency of our approach.
Keywords:
Hybrid systems (HS)
reachability analysis
solvable systems (SSs)
Tarski's algebra
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
View more organizations