A Unified Framework for Verification of Observational Properties for Partially-Observed Discrete-Event Systems

被引:3
作者
Zhao, Jianing [1 ,2 ]
Li, Shaoyuan [1 ,2 ]
Yin, Xiang [1 ,2 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Automat, Shanghai 200240, Peoples R China
[2] Minist Educ China, Key Lab Syst Control & Informat Proc, Shanghai 200240, Peoples R China
基金
中国国家自然科学基金;
关键词
Model checking; Standards; Security; Complexity theory; Trajectory; Semantics; Observers; Discrete-event systems (DES); HyperLTL; partial observation; property verification; DIAGNOSABILITY; DETECTABILITY; OPACITY;
D O I
10.1109/TAC.2024.3355378
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this article, we investigate property verification problems in partially-observed discrete-event systems (DES). Particularly, we are interested in verifying observational properties that are related to the information-flow of the system. Observational properties considered here include diagnosability, predictability, detectability, and opacity, which have drawn considerable attentions in the literature. However, in contrast to existing results, where different verification procedures are developed for different properties case by case, in this work, we provide a unified framework for verifying all these properties by reducing each of them as an instance of HyperLTL model checking. Our approach is based on the construction of a Kripke structure that effectively captures the issue of unobservability as well as the finite string semantics in partially-observed DES so that HyperLTL model checking techniques can be suitably applied. Then for each observational property considered, we explicitly provide the HyperLTL formula to be checked over the Kripke structure for the purpose of verification. Our approach is uniform in the sense that all different properties can be verified with the same model checking engine and also brings new insights for classifying observational properties in terms of their verification complexity. Numerical experiments are conducted, which show that our framework is computationally more efficient for verifying properties involving quantifier alternations, such as opacity, compared with the standard subset-based approaches.
引用
收藏
页码:4710 / 4717
页数:8
相关论文
共 31 条
[31]  
Zhao JN, 2022, Arxiv, DOI arXiv:2205.01392