Institutional Repository
| Barrier certificates revisited | |
| Dai, Liyun1,2; Gan, Ting1,2; Xia, Bican1,2; Zhan, Naijun3 | |
| 2017-05-01 | |
| Source | JOURNAL OF SYMBOLIC COMPUTATION
 |
| Volume | 80Pages:62-86 |
| English Abstract | A barrier certificate can separate the state space of a considered hybrid system (HS) into safe and unsafe parts according to the safety property to be verified. Therefore this notion has been widely used in the verification of HSs. A stronger condition on barrier certificates (BCs) means that fewer BCs can be synthesized, as the expressiveness of synthesized BCs is weaker. On the other hand, synthesizing more expressive BCs normally means higher complexity. Kong et al. (2013a) investigated how to relax the condition of BCs while still keeping their convexity so that one can synthesize more expressive BCs efficiently using semi-definite programming (SDP). In this paper, we first discuss how to relax the condition of BCs in a general way, while still keeping their convexity. Thus, one can utilize different weaker conditions flexibly to synthesize different kinds of BCs with more expressiveness efficiently using SDP, which gives more opportunities to verify the considered system. We also show how to combine two functions together to form a combined BC in order to prove a safety property under consideration, whereas neither of them may be a BC separately. In fact, the notion of combined BCs is strictly more expressive than that of BCs, so it further brings more chances to verify a considered system. Another contribution of this paper is to investigate how to avoid the unsoundness of SDP based approaches caused by numerical error through symbolic checking. (C) 2016 Elsevier Ltd. All rights reserved. |
| Indexed Type | SCI ; ISTP |
| DOC Type | Article |
| Keyword | Hybrid System Barrier Certificate Formal Verification Invariant Nonlinear System Semi-definite Programming Sum Of Squares |
| WOS Headings | Science & Technology ; Technology ; Physical Sciences |
| WOS Subject | Computer Science, Theory & Methods ; Mathematics, Applied |
| DOI | 10.1016/j.jsc.2016.07.010 |
| WOS Subject Extended | Computer Science ; Mathematics |
| WOS Keyword Plus | HYBRID SYSTEMS ; ALGORITHMIC ANALYSIS ; SAFETY VERIFICATION ; INVARIANTS |
| Language | 英语 |
| WOS ID | WOS:000390831700004 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/18862 |
| Collection | 基础软件与系统重点实验室 |
| Affiliation | 1.Peking Univ, LMAM, Beijing, Peoples R China 2.Peking Univ, Sch Math Sci, Beijing, Peoples R China 3.Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100864, Peoples R China |
| Recommended Citation GB/T 7714 | Dai, Liyun,Gan, Ting,Xia, Bican,et al. Barrier certificates revisited[J]. JOURNAL OF SYMBOLIC COMPUTATION,2017,80:62-86. |
| APA | Dai, Liyun,Gan, Ting,Xia, Bican,&Zhan, Naijun.(2017).Barrier certificates revisited.JOURNAL OF SYMBOLIC COMPUTATION,80,62-86. |
| MLA | Dai, Liyun,et al."Barrier certificates revisited".JOURNAL OF SYMBOLIC COMPUTATION 80(2017):62-86. |
| 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