离散事件系统弱可预测性的验证算法  

Verification Algorithm for Weak Prognosability of Discrete Event Systems

作　　者：曹卫华[1] 刘富春[1] CAO Weihua;LIU Fuchun(School of Computers,Guangdong University of Technology,Guangzhou 510006,China)

机构地区：[1]广东工业大学计算机学院,广州510006

出　　处：《计算机科学》2023年第S02期955-960,共6页Computer Science

基　　金：国家自然科学基金(61673122);广东省自然科学基金(2019A1515010548,2020A1515010941)。

摘　　要：对故障检测来说,预测比诊断更能降低故障对系统造成的损失,但即使大多数的故障事件串是可预测的,只要有一个故障事件串是不可预测只能诊断的,整个系统就是不可预测的,只能用诊断的方法处理,这对大多数的故障事件串是不利的。为此,提出了弱可预测性的概念。弱可预测性是对系统未来是否一定会处于故障状态这一情况的预测。相比可预测性,弱可预测性不要求所有故障事件串都是可预测的。对可预测的故障事件串,弱可预测性能够在故障发生之前发出警报,而对不可预测只能诊断的故障事件串,其也能在故障发生之后发出警报。文中构造了证明器来测试系统的弱可预测性,并基于这个证明器给出了测试系统弱可预测性的多项式复杂度的算法,给出了弱可预测性的充分必要条件。This paper proposes the concept of weak prognosability.For fault detection,prognosis can reduce the loss caused by faults to the system more than diagnosis.However,even if most fault strings are prognosable,as long as one fault string is unprognosable and can only be diagnosed,the whole system is unprognosable and can only be handled by diagnosis,which is unfavorable to most fault strings.The concept of weak prognosability can avoid this situation.Weak prognosability is the prediction of whether the system will be in a fault state in the future.Compared with prognosability,weak prognosability does not require all fault event strings to be prognosable.Weak prognosability can alarm the prognosable fault strings before the fault occurs,and it can also alarm the unprognosable but diagnosable fault strings after the fault occurs.A verifier is constructed to test the weak prognosability of the system,a polynomial algorithm of weak prognosability of the system is given based on the verifier,and the sufficient and necessary conditions of weak prognosability are also given.

关 键 词：离散事件系统 故障预测 弱可预测性 多项式复杂度 自动机 

分 类 号：TP206[自动化与计算机技术—检测技术与自动化装置]