Abstract | ||
---|---|---|
Periodically online verification has been widely recognized as a practical and promising method to handle the non-deterministic and unpredictable behavior of dynamic CPS systems. However, it is a challenge to keep the online verification of CPS systems finishing quickly in time to give enough time for the running system to respond, if any error is detected. Nevertheless, the problems under verification for each cycle are highly similar to each other. Most of the differences are caused by run-time factors like changing of parameters' values or the reorganization of active components in the system. Under this investigation, this paper presents an incremental verification technique for online verification of CPS systems. A method is given to distinguish the differences between the problem under verification and the previous verified problem. Then, by reusing the problem space of the previous verified problem as a warm-start base, the modified part can be introduced into the base, which can be solved incrementally and efficiently. A set of case studies on a real-case train control system is presented in this paper to demonstrate the performance of the incremental online verification technique. |
Year | DOI | Venue |
---|---|---|
2019 | 10.23919/DATE.2019.8715003 | 2019 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE) |
Field | DocType | ISSN |
Computer science,Real-time computing,Cyber-physical system,Distributed computing | Conference | 1530-1591 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Lei Bu | 1 | 189 | 22.50 |
Shaopeng Xing | 2 | 0 | 1.69 |
Xinyue Ren | 3 | 0 | 0.34 |
Yang Yang | 4 | 0 | 1.01 |
Qixin Wang | 5 | 503 | 39.57 |
Li Xuandong | 6 | 672 | 79.78 |