...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Automatic Control, IEEE Transactions on >Decentralized Prognosis of Failures in Discrete Event Systems
【24h】

Decentralized Prognosis of Failures in Discrete Event Systems

机译：离散事件系统中的故障分散预测

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We study the prognosis of failures, i.e., their prediction prior to their occurrence, in discrete event systems in a decentralized setting where multiple prognosers use their local observations to issue local prognosis decisions. We define the notion of correctness of a decentralized set of prognosers in terms of “no missed detections” (each failure is prognosed prior to its occurrence) and “no false alarms” (an incorrect prognostic decision is never issued), and introduce the notion of coprognosability as an existence condition. When specialized to the centralized case (i.e., the case of a single prognoser), this condition turns out to be weaker than the one introduced by Genc and Lafortune in 2006 since a uniform bound on the number of steps within which a failure will occur is not required. For comparison, we also introduce the stronger notion of “uniformly bounded coprognosability” and identify the subclass of decentralized prognosers for which it serves as an existence condition. We show that the two notions coincide when the underlying system and its nonfailure specification possess finite-state representations, and present a verification algorithm whose complexity is polynomial in the sizes of the system being prognosed and its nonfailure specification, and is exponential in the number of the local prognosers. We also introduce the notion of reaction bound for coprognosis as the earliest time beyond a prognostic decision when a failure can occur, and present an algorithm for computing it. The complexity of this algorithm is identical to that of the verification algorithm. An algorithm with complexity linear in the size of the specification and the number of local prognosers is also presented for an online prognosis of failures. We show that the notions of coprognosability and its uniformly bounded version are in gene-nral incomparable with the notion of codiagnosability (that guarantees a uniformly bounded delay detection of a failure by a local diagnoser). When the system cannot execute an unbounded sequence of unobservable events, uniformly bounded coprognosability implies codiagnosability, whereas coprognosability and codiagnosability remain incomparable.
机译：我们在分散环境中的离散事件系统中研究故障的预后，即在故障发生之前对其进行的预测，在该系统中，多个预后人员使用其本地观察结果来发布本地预后决策。我们以“无遗漏的检测”（每个故障均在发生之前进行预诊断）和“无虚假的警报”（从不发布错误的预后决策）的角度定义分散的一组预后程序的正确性概念，并引入概念预后性作为生存条件。当专门针对集中式案例（即单个预言者的案例）时，这种情况比Genc和Lafortune在2006年引入的情况要弱一些，因为对发生故障的步骤数量的统一限制是不需要。为了进行比较，我们还引入了“一致有局限的联合预后性”这一更强的概念，并确定了分散预后者作为其存在条件的子类。我们证明了当底层系统及其非故障规范具有有限状态表示形式时，这两个概念是重合的，并提出了一种验证算法，该算法的复杂度在所要预测的系统的大小及其非故障规范中是多项式的，并且在数量上是指数级的当地的预后。我们还介绍了用于预后的反应概念，它是发生故障时超出预后决策的最早时间，并提出了一种计算方法。该算法的复杂度与验证算法相同。还提出了一种算法，该算法的复杂度在规范的大小和本地预测者的数量之间呈线性关系，用于在线故障预测。我们表明，协同预后性及其统一界线的概念与协同诊断性（保证本地诊断程序对故障的统一界线延迟检测）无可比拟。当系统无法执行不可观测事件的无穷序列时，一致有界的协同诊断能力意味着协同诊断能力，而协同诊断能力和协同诊断能力仍然无法比拟。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号