Fault Pattern Diagnosis of Discrete-Event Systems by Means of Logical Verifiers

Liang, Ye; Lefebvre, Dimitri; Li, Zhiwu

doi:10.1016/j.ifacol.2022.07.186

Cited by 2 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Inspired by the notion of synchronous product of two automata, this section introduces a synchronous product verifier. Note that a state isolation based verifier can also be obtained for fault pattern detection [31,38], whose structure is similar to the synchronous product verifier. For the sake of simplicity, the details are not pursued here.…”

Section: Fault Pattern Detection Based On Synchronous Productmentioning

confidence: 99%

Silent closure based pair verifier for fault pattern diagnosis of discrete event systems

Liang,

Lefebvre,

2023

IET Control Theory & Appl

View full text Add to dashboard Cite

This paper addresses fault pattern diagnosis of discrete event systems, involving fault pattern detection and diagnosability. A fault pattern is modelled as a finite automaton whose accepted language is the objective to be diagnosed, representing the occurrence of complex or composite faults. A verifier for fault pattern detection based on the synchronous product of a system and a fault pattern is proposed. By removing all silent events, a silent closure is calculated based on the synchronous product, which offers computational advantages for systems that have a large number of silent events. An NSC/FSC pair verifier is then computed by taking the product of a normal silent closure and an accepted silent closure. By studying indeterminate cycles of the NSC/FSC pair verifier, necessary and sufficient verification conditions are established, asserting that a system is diagnosable with respect to a fault pattern if and only if there is no indeterminate cycle in the NSC/FSC pair verifier. It is shown that the proposed method requires polynomial time at most. Finally, a case study to illustrate the results is provided.

show abstract

Section: Fault Pattern Detection Based On Synchronous Productmentioning

confidence: 99%

Silent closure based pair verifier for fault pattern diagnosis of discrete event systems

Liang,

Lefebvre,

2023

IET Control Theory & Appl

View full text Add to dashboard Cite

show abstract

“…Experience with monitoring dynamic systems shows that there is a large spectrum of faulty situations in practical systems [11], such as multiple faults, intermittent faults [12], and temporary faults [13] that are not consistent with single-event faults. In order to consider these complex situations, such as temporary and/or intermittent faults, fault pattern diagnosis simultaneously emerges as a promising research area, which provides a general way to solve the diagnosis problems by capturing the occurrences of particular strings in a system and gains extensive attention from both researchers and practitioners, leading to a bulk of documented results [14][15][16][17][18][19][20].…”

Section: Introductionmentioning

confidence: 99%

“…This also introduces fault patterns in the problem of prediction. The authors of [16] address the fault pattern diagnosis by means of state isolation. In contrast to the approach in [14], which builds a diagnoser with potentially exponential complexity, the method proposed in [16] performs state estimation in a recursive manner.…”

Section: Introductionmentioning

confidence: 99%

“…The authors of [16] address the fault pattern diagnosis by means of state isolation. In contrast to the approach in [14], which builds a diagnoser with potentially exponential complexity, the method proposed in [16] performs state estimation in a recursive manner. This approach offers the advantage of lower complexity for fault pattern detection.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Polynomial-Time Verification of Decentralized Fault Pattern Diagnosability for Discrete-Event Systems

Liang,

Liu,

El-Sherbeeny

2023

Mathematics

Self Cite

View full text Add to dashboard Cite

This paper considers the verification of decentralized fault pattern diagnosability for discrete event systems, where the pattern is modeled as a finite automaton whose accepted language is the objective to be diagnosed. We introduce a notion of codiagnosability to formalize the decentralized fault pattern diagnosability, which requires the pattern to be detected by one of the external local observers within a bounded delay. To this end, a structure, namely a verifier, is proposed to verify the codiagnosability of the system and the fault pattern. By studying an indeterminate cycle of the verifier, sufficient and necessary conditions are provided to test the codiagnosability. It is shown that the proposed method requires polynomial time at most. In addition, we present an approach to extend the proposed verifier structure so that it can be applied to centralized cases.

show abstract

Fault Pattern Diagnosis of Discrete-Event Systems by Means of Logical Verifiers

Cited by 2 publications

References 12 publications

Silent closure based pair verifier for fault pattern diagnosis of discrete event systems

Silent closure based pair verifier for fault pattern diagnosis of discrete event systems

Polynomial-Time Verification of Decentralized Fault Pattern Diagnosability for Discrete-Event Systems

Contact Info

Product

Resources

About