arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1710.02877eess.SYcs.FLcs.SY
收藏

模块化离散事件系统中检测性、保密性及A诊断性的复杂性

Complexity of Detectability, Opacity and A-Diagnosability for Modular Discrete Event Systems

Czech Academy of Sciences(捷克科学院);Shanghai Jiao Tong University(上海交通大学)

Tomáš Masopust, Xiang Yin

AI总结:

本文研究模块化离散事件系统中检测性、保密性和A诊断性的复杂性,证明其比单体系统更复杂,为EXPSPACE完全问题,特殊情况下为PSPACE完全。

摘要:

我们研究决定模块化离散事件系统是否可检测(resp. 保密,A诊断)的复杂性。检测性出现在离散事件系统的状态估计中,保密性与隐私和安全分析相关,A诊断性出现在随机离散事件系统的故障诊断中。此前,决定单体系统弱检测性(保密性,A诊断性)被证明为PSPACE完全。本文研究模块化系统的复杂性,证明这些问题的复杂性显著高于单体情况。即,我们证明决定模块化弱检测性(保密性,A诊断性)为EXPSPACE完全。我们进一步讨论特殊情况,即所有不可观测事件都是私有的,证明在这种情况下问题为PSPACE完全。因此,如果系统都是完全可观测的,则决定模块化系统的弱检测性(保密性)为PSPACE完全。

英文摘要:

We study the complexity of deciding whether a modular discrete event system is detectable (resp. opaque, A-diagnosable). Detectability arises in the state estimation of discrete event systems, opacity is related to the privacy and security analysis, and A-diagnosability appears in the fault diagnosis of stochastic discrete event systems. Previously, deciding weak detectability (opacity, A-diagnosability) for monolithic systems was shown to be PSPACE-complete. In this paper, we study the complexity of deciding weak detectability (opacity, A-diagnosability) for modular systems. We show that the complexities of these problems are significantly worse than in the monolithic case. Namely, we show that deciding modular weak detectability (opacity, A-diagnosability) is EXPSPACE-complete. We further discuss a special case where all unobservable events are private, and show that in this case the problems are PSPACE-complete. Consequently, if the systems are all fully observable, then deciding weak detectability (opacity) for modular systems is PSPACE-complete.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑