Introduction to Estimation and Inference in Discrete Event Systems

Hadjicostis, Christoforos N.

doi:10.1007/978-3-030-30821-6_1

Cited by 3 publications

(3 citation statements)

References 30 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%

“…To overcome the potential state explosion problem, a pair verifier technique [25,26] is introduced to offer a worst case polynomial test with respect to the number of system states for diagnosability. Several extensions have been developed [13,[27][28][29][30][31][32][33][34][35][36]. The pair verifier structures are mainly obtained from the self composition of the verifiers.…”

Section: Introductionmentioning

confidence: 99%

“…The pair verifier structures are mainly obtained from the self composition of the verifiers. In particular, an algorithm with linear complexity proposed in [31] converts the fault detection problem into state isolation to determine whether the observations allow us to isolate the states to be within a particular set of states that indicates the occurrence of failures. Especially, the authors in [32] propose two types of pair verifiers in a decentralized diagnosis framework with respect to different local decisions, and the authors in [33] address the modular diagnosability problem by computing a pair verifier.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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%