Institutional Repository
| Some decidable results on reachability of solvable systems | |
| Xu, Ming; Zhu, Jiaqi; Li, Zhi-Bin | |
| 2013 | |
| Source | INTERNATIONAL JOURNAL OF GENERAL SYSTEMS
 |
| ISSN | 0308-1079 |
| Volume | 42Issue:4Pages:405-425 |
| English Abstract | Reachability analysis plays an important role in verifying the safety of modern control systems. In the existing work, there are many decidable results on reachability of discrete systems. For continuous systems, however, the known decidable results are established merely for linear systems. In this paper, we propose a class of nonlinear systems (named solvable systems) extending linear systems. We first show that their solutions are of closed form. On the basis of it, we study a series of reachability problems for various subclasses of solvable systems. Our main results are that these reachability problems are decidable by manipulations in number theory, real root isolation, and quantifier elimination. Finally the decision procedures are implemented in a Maple package REACH to solve several non-trivial examples.; Reachability analysis plays an important role in verifying the safety of modern control systems. In the existing work, there are many decidable results on reachability of discrete systems. For continuous systems, however, the known decidable results are established merely for linear systems. In this paper, we propose a class of nonlinear systems (named solvable systems) extending linear systems. We first show that their solutions are of closed form. On the basis of it, we study a series of reachability problems for various subclasses of solvable systems. Our main results are that these reachability problems are decidable by manipulations in number theory, real root isolation, and quantifier elimination. Finally the decision procedures are implemented in a Maple package REACH to solve several non-trivial examples. |
| Indexed Type | SCI |
| Keyword | Reachability Analysis Solvable Mappings Nonlinear Systems Hybrid Systems Symbolic Computation Decision Procedures |
| Department | [Xu, Ming; Li, Zhi-Bin] E China Normal Univ, Dept Comp Sci & Technol, Shanghai 200241, Peoples R China. [Xu, Ming; Zhu, Jiaqi] Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190, Peoples R China. |
| Language | 英语 |
| WOS ID | WOS:000315676500007 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16937 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Xu, Ming,Zhu, Jiaqi,Li, Zhi-Bin. Some decidable results on reachability of solvable systems[J]. INTERNATIONAL JOURNAL OF GENERAL SYSTEMS,2013,42(4):405-425. |
| APA | Xu, Ming,Zhu, Jiaqi,&Li, Zhi-Bin.(2013).Some decidable results on reachability of solvable systems.INTERNATIONAL JOURNAL OF GENERAL SYSTEMS,42(4),405-425. |
| MLA | Xu, Ming,et al."Some decidable results on reachability of solvable systems".INTERNATIONAL JOURNAL OF GENERAL SYSTEMS 42.4(2013):405-425. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment