Optimal Constructions for Active Diagnosis

Abstract : The task of diagnosis consists in detecting, without ambiguity, occurrence of faults in a partially observed system. Depending on the degree of observability, a discrete event system may be diagnosable or not. Active diagnosis aims at controlling the system in order to make it diagnosable. Solutions have already been proposed for the active diagnosis problem, but their complexity remains to be improved. We solve here the active diagnosability decision problem and the active diagnoser synthesis problem, proving that (1) our procedures are optimal w.r.t. to computational complexity, and (2) the memory required for the active diagnoser produced by the synthesis is minimal. We then focus on the delay between the occurrence of a fault and its detection by the diagnoser. We construct a memory-optimal diagnoser whose delay is at most twice the minimal delay, whereas the memory required for a diagnoser with optimal delay may be highly greater.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00926098
Contributor : Benedikt Bollig <>
Submitted on : Thursday, January 9, 2014 - 10:13:36 AM
Last modification on : Wednesday, December 4, 2019 - 1:26:02 PM

Identifiers

  • HAL Id : hal-00926098, version 1

Citation

Stefan Haar, Serge Haddad, Tarek Melliti, Stefan Schwoon. Optimal Constructions for Active Diagnosis. 33rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'13), Dec 2013, Guwahati, India. pp.527-539. ⟨hal-00926098⟩

Share

Metrics

Record views

313