Diagnosability of discrete event systems

Sampath, Meera; Sengupta, Raja; Lafortune, Stéphane; Sinnamohideen, K.; Teneketzis, Demosthenis

doi:10.1007/bfb0033534

Cited by 258 publications

(757 citation statements)

References 6 publications

Supporting

Mentioning

727

Contrasting

Unclassified

Order By: Relevance

“…Diagnosability checking is for the purposes of: (1) online detection and isolation of faults and (2) off-line verification of system whether can be diagnosed or not [24]. The diagnoser should be able to detect fault after a finite step of delay from its occurrence.…”

Section: Diagnosability Evaluationmentioning

confidence: 99%

A realtime fuzzy Petri net diagnoser for detecting progressive faults in PLC based discrete manufacturing system

Hsieh

2011

Int J Adv Manuf Technol

View full text Add to dashboard Cite

In this paper, we explored a realtime fuzzy Petri net approach to diagnose progressive faults in discrete manufacturing systems. Progressive faults are usually caused by deterioration or aging and show stochastic properties. Some researchers have reported how to detect abrupt faults in discrete manufacturing systems using Petri net. However, little research has been conducted on Petri net diagnoser to progressive faults in discrete manufacturing event systems. To tackle this problem, we explored an approach including a realtime Petri net model and a fuzzy Petri net diagnoser to replicate the plant and detect faults in discrete manufacturing systems. The realtime Petri net model monitors events generated from the discrete manufacturing system, also compares the outputs and pre-settings. Once a difference is detected, it will start the fuzzy Petri net diagnoser to locate faults. For the purpose of validation, this approach was implemented with Visual Basic for diagnosing a dual robot arm. Evaluation experiments validated the diagnoser's performance on accuracy and diagnosability. It illustrated that the proposed approach can have a high accuracy rate of 93% and maximum diagnosis delay of eight steps; it proves that the approach has the capability of integrating knowledge and handling uncertainties. It also remedies the nonsynchronization between the diagnoser and the plant. The approach to construct the model and diagnoser is systematic; it has an excellent projection on intermittent fault diagnosis and hybrid systems.

show abstract

Section: Diagnosability Evaluationmentioning

confidence: 99%

A realtime fuzzy Petri net diagnoser for detecting progressive faults in PLC based discrete manufacturing system

Hsieh

2011

Int J Adv Manuf Technol

View full text Add to dashboard Cite

show abstract

“…Even under partial observation, some hidden information may be computationally reconstructible from some specification of the system. Typical fields that address such issues are those of information flow detection (Badouel et al 2007;Bryans et al 2008;Cassez 2009), diagnosis (Sampath et al 1995;Yoo and Lafortune 2002;Jéron et al 2006;Tripakis 2002;Bouyer et al 2005), and combination of both (Dubreil et al 2009). …”

Section: Introductionmentioning

confidence: 98%

“…For infinite systems however, Cassez (2009) and Bryans et al (2008) show its undecidability for timed systems and general Petri nets. Regarding diagnosis, the diagnosability property is now well understood (Sampath et al 1995;Cassandras and Lafortune 1999;Jéron et al 2006;Jiang et al 2000), and the most efficient checking procedure seeks for particular cycles in a selfproduct construction, hence it yields a quadratic-time algorithm. On the contrary, for infinite systems, this approach may not be effective in general.…”

Section: Introductionmentioning

confidence: 98%

“…In an ideal situation, we expect the device to be sound (when a fault is declared, it is indeed the case) and complete (every faulty behavior is eventually revealed within a finite delay). Soundness is often guaranteed by equipping the device with standard state estimate techniques, whereas completeness, also known as the diagnosability property (Sampath et al 1995;Yoo and Lafortune 2002), is tightly coupled with the observation capabilities and has to be established on its own.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems

Chédor

Morvan

Pinchinat

et al. 2014

Discrete Event Dyn Syst

View full text Add to dashboard Cite

The analysis of discrete event systems under partial observation is an important topic, with major applications such as the detection of information flow and the diagnosis of faulty behaviors. These questions have, mostly, not been addressed for classical models of recursive systems, such as pushdown systems and recursive state machines. In this paper, we consider recursive tile systems, which are recursive infinite systems generated by a finite collection of finite tiles, a simplified variant of deterministic graph grammars (slightly more general than pushdown systems). Since these systems are infinite-state in general powerset constructions for monitoring do not always apply. We exhibit computable conditions on recursive tile systems and present non-trivial constructions that yield effective computation of the monitors. We apply these results to the classic problems of state-based opacity and diagnosability (off-line verification of opacity and diagnosability, and also runtime monitoring of these properties). For a decidable subclass of recursive tile systems, we also establish the decidability of the problems of state-based opacity and diagnosability.

show abstract

“…The diagnosis of (discrete-event) systems, originally formalized in Sampath et al (1995Sampath et al ( , 1996, consists of establishing a diagnosis on the status of the actual computation of the system regarding a given property, based on externally observable events of this computation. Another closely related topic is the prediction where the veracity of the property is to be foreseen, alike diagnosis of inevitability (Jéron et al 2008).…”

Section: Introductionmentioning

confidence: 99%

Prognosis of ω-Languages for the Diagnosis of *-Languages: A Topological Perspective

Bauer

Pinchinat

2009

Discrete Event Dyn Syst

View full text Add to dashboard Cite

This article offers a novel perspective on the diagnosis of * -languages via a topological characterization of ω-languages. This allows for the different concepts that currently exist in diagnosis of discrete-event systems to be related to one another in a uniform setting and to study their complexity. For this purpose, we introduce the notion of prognosability of an ω-language, which in the classical setting corresponds to testing if a language is diagnosable and prediagnosable. We show that we can build a prognoser for some ω-language if this language is open and saturated, where openness is usually implied in the finitary setting. For both of these problems we present PSPACE algorithms, and establish that prognosability (i.e., whether or not a prognoser exists) for an ω-language is a PSPACE-complete problem. Our new characterization offers a novel point of view in the classical setting of diagnosis.

show abstract

Diagnosability of discrete event systems

Cited by 258 publications

References 6 publications

A realtime fuzzy Petri net diagnoser for detecting progressive faults in PLC based discrete manufacturing system

A realtime fuzzy Petri net diagnoser for detecting progressive faults in PLC based discrete manufacturing system

Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems

Prognosis of ω-Languages for the Diagnosis of *-Languages: A Topological Perspective

Contact Info

Product

Resources

About