A Polynomial-Time Algorithm for Diagnosability Verification of Discrete Event Systems - Archive ouverte HAL Access content directly
Conference Papers Year :

A Polynomial-Time Algorithm for Diagnosability Verification of Discrete Event Systems

Abstract

This paper concerns the problem of diagnosing the occurrence of permanent fault events in partially observed discrete event systems modelled as finite-state automata in a event-based framework. The first step is the verification of the existence of diagnosers (the diagnosability problem) for such systems. We define a necessary and sufficient condition of diagnosability of such systems. The results proposed in this paper allow testing the diagnosability of discrete event systems in an efficient way, i.e. in polynomial time. The diagnosability test is stated in terms of existence of similar cycles of observable events both in the faultless model and in the faulty model.
Not file

Dates and versions

hal-01132001 , version 1 (16-03-2015)

Identifiers

  • HAL Id : hal-01132001 , version 1

Cite

E. Gascard, Zineb Simeu-Abazi, B. Suiphon. A Polynomial-Time Algorithm for Diagnosability Verification of Discrete Event Systems. 2nd World Conference on Complex Systems (WCCS'14), Nov 2014, Agadir, Morocco. ⟨hal-01132001⟩
68 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More