TY - GEN
T1 - Towards ‘verifying’ a water treatment system
AU - Wang, Jingyi
AU - Sun, Jun
AU - Jia, Yifan
AU - Qin, Shengchao
AU - Xu, Zhiwu
PY - 2018/7/12
Y1 - 2018/7/12
N2 - Modeling and verifying real-world cyber-physical systems is challenging, which is especially so for complex systems where manually modeling is infeasible. In this work, we report our experience on combining model learning and abstraction refinement to analyze a challenging system, i.e., a real-world Secure Water Treatment system (SWaT). Given a set of safety requirements, the objective is to either show that the system is safe with a high probability (so that a system shutdown is rarely triggered due to safety violation) or not. As the system is too complicated to be manually modeled, we apply latest automatic model learning techniques to construct a set of Markov chains through abstraction and refinement, based on two long system execution logs (one for training and the other for testing). For each probabilistic safety property, we either report it does not hold with a certain level of probabilistic confidence, or report that it holds by showing the evidence in the form of an abstract Markov chain. The Markov chains can subsequently be implemented as runtime monitors in SWaT.
AB - Modeling and verifying real-world cyber-physical systems is challenging, which is especially so for complex systems where manually modeling is infeasible. In this work, we report our experience on combining model learning and abstraction refinement to analyze a challenging system, i.e., a real-world Secure Water Treatment system (SWaT). Given a set of safety requirements, the objective is to either show that the system is safe with a high probability (so that a system shutdown is rarely triggered due to safety violation) or not. As the system is too complicated to be manually modeled, we apply latest automatic model learning techniques to construct a set of Markov chains through abstraction and refinement, based on two long system execution logs (one for training and the other for testing). For each probabilistic safety property, we either report it does not hold with a certain level of probabilistic confidence, or report that it holds by showing the evidence in the form of an abstract Markov chain. The Markov chains can subsequently be implemented as runtime monitors in SWaT.
UR - http://www.scopus.com/inward/record.url?scp=85050339969&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-95582-7_5
DO - 10.1007/978-3-319-95582-7_5
M3 - Conference contribution
SN - 9783319955810
T3 - Lecture Notes in Computer Science
SP - 73
EP - 92
BT - Formal Methods - 22nd International Symposium, FM 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings
A2 - Havelund, Klaus
A2 - Roscoe, Bill
A2 - de Vink, Erik
A2 - Peleska, Jan
PB - Springer Verlag
T2 - International Symposium on Formal Methods 2018
Y2 - 15 July 2018 through 17 July 2018
ER -