Compositional bounded reachability using time partitioning and abstraction

bounded reachability;decomposition;composition;hybrid system;abstraction;safety verification

Green, Jeremy ; Mitra ; Sayan

关键词: bounded reachability;    decomposition;    composition;    hybrid system;    abstraction;    safety verification;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/34351/Green_Jeremy.pdf?sequence=1&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

Automatic verification of cyber-physical systems (CPS) typically involves computing the reachable set of states of such systems. This computation is known to be exponential in the number of continuous variables. For systems that can be decomposed into separate components with lower dimensionality, we present an algorithm that verifies global safety properties of the complete system using the reach sets of the components. Here, the components are only coupled through a shared time variable. Using a satellite system case study, we are able to show significant savings in memory and runtime computation costs for this approach. For systems whose components are coupled through additional continuous variables, we present an abstraction to overapproximate the interaction between the components such that the aforementioned algorithm can be used. The feasibility of this abstraction is demonstrated experimentally, which also shows additional work is necessary to develop a more efficient abstraction.