Fault Diagnosis in Discrete Event Systems using Interpreted Petri Nets
Fault Diagnosis in Discrete Event Systems using Interpreted Petri Nets
复制标题
使用解释性 Petri 网进行离散事件系统中的故障诊断
DOI：
10.5772/5534
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
Cinvestav Unidad Guadalajara
中科院分区：
文献类型：
--
作者：
J. Arámburo;A. Ramírez;E. López;E. Ruiz;Cinvestav Unidad Guadalajara
离散事件系统（DES）的可诊断性和故障检测方案已被广泛地处理集中的方法，使用的全球模型。粗略地说，可诊断性是确定使用系统模型是否可以在有限数量的步骤中检测和定位故障状态的属性。在工作中（Sampath等人，1995）和（Sampath等人，1996）提出了一种用有限自动机对DES进行建模的方法，并在此模型的基础上导出了诊断器。诊断器中的循环用于确定DES何时可诊断。最近，DES的故障诊断已经通过分布式方法来解决，该分布式方法允许在处理大型和复杂系统时分解复杂性（Benveniste等人，2003; O. Contant等人，2004; Debouk等人，2000; Genc & Lafortune，2003; Jiroveanu & Boel，2003; Pencole，2004; Aramburo-Lizarraga等人，2005年）。在（Debouk等人，2000）提出了一种分散的和模块化的方法来基于Sampath的结果执行故障诊断（Sampath，et al.，1995年）。在（Contant等人，2004）和（Pencole，2004），作者提出了基于（Sampath，et al.，1995）以分布式的方式;他们认为系统的组件演变的事件的发生;并行组成导致一个完整的系统模型棘手。在（Genc & Lafortune，2003）中，提出了一种处理PN模型的可达性图以便类似于（Sampath，et al.，（1995年）;基于设计考虑，将模型划分为两个标号PN，证明了分布式诊断与集中式诊断等价; 2随后，（Genc & Lafortune，2005）将结果推广到由共享位置的多个标号PN建模的系统，并给出了确定分布式诊断的算法。Qiu & Kumar，2005研究了系统的可诊断性，该性质保证了系统中发生的任何故障都必须由至少一个局部诊断器利用局部信息在有限步内检测到，此外，还提出了安全可诊断性的概念，以描述系统在性能允许的情况下具有安全规范的事实。（Aramburo-Lizarraga等人，2005）提出了一种用于设计简化诊断器的方法，并提出了一种将全局模型分割成用于构建分布式诊断器的一组通信子模型的算法。诊断器处理系统子模型，并且每个诊断器具有一组通信事件，用于在ab as ew w .ite ch上检测和操作A cc s D。共m
Diagnosability property and fault detection schemes have been widely addressed on centralized approaches using the global model of the Discrete Event System (DES). Roughly speaking, diagnosability is the property of determining if using the system model is possible to detect and locate the faulty states in a finite number of steps. In the works (Sampath, et al., 1995) and (Sampath, et al., 1996), a method for modeling a DES using finite automata is proposed; based on this model, a diagnoser is derived. The cycles in the diagnoser are used to determine when the DES is diagnosable. Recently, fault diagnosis of DES has been addressed through a distributed approach allowing breaking down the complexity when dealing with large and complex systems (Benveniste, et al., 2003; O. Contant, et al., 2004; Debouk, et al., 2000; Genc & Lafortune, 2003; Jiroveanu & Boel, 2003; Pencole, 2004; Aramburo-Lizarraga, et al., 2005). In (Debouk, et al., 2000) it is proposed a decentralized and modular approach to perform failure diagnosis based on Sampath's results (Sampath, et al., 1995). In (Contant, et al., 2004) and (Pencole, 2004) the authors presented incremental algorithms to perform diagnosability analysis based on (Sampath, et al., 1995) in a distributed way; they consider systems whose components evolve by the occurrence of events; the parallel composition leads to a complete system model intractable. In (Genc & Lafortune, 2003) it is proposed a method that handles the reachability graph of the PN model in order to perform the analysis similarly to (Sampath, et al., 1995); based on design considerations the model is partitioned into two labelled PN and it is proven that the distributed diagnosis is equivalent to the centralized diagnosis; later, (Genc & Lafortune, 2005) extend the results to systems modeled by several labelled PN that share places, and present an algorithm to determine distributed diagnosis. In (Qiu & Kumar, 2005) it is studied the codiagnosability property, this property guarantees that any faults occurred in the system must be detected by at least one local diagnoser in a finite number of steps using the local information, besides, a notion of safe-codiagnosability is mentioned to capture the fact that the system has a safe specification while the system performance is tolerable. (Aramburo-Lizarraga, et al., 2005) proposes a methodology for designing reduced diagnosers and presents an algorithm to split a global model into a set of communicating sub-models for building distributed diagnosers. The diagnosers handle a system sub-model and every diagnoser has a set of communication events for detecting and O pe n A cc es s D at ab as e w w w .ite ch on lin e. co m