Foundation of Diagnosis and Predictability in Probabilistic Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Foundation of Diagnosis and Predictability in Probabilistic Systems


In discrete event systems prone to unobservable faults, a diagnoser must eventually detect fault occurrences. The diagnosability problem consists in deciding whether such a diagnoser exists. Here we investigate diagnosis for probabilistic systems modelled by partially observed Markov chains also called probabilistic labeled transition systems (pLTS). First we study different spe-cifications of diagnosability and establish their relations both in finite and infinite pLTS. Then we analyze the complexity of the diagnosability problem for finite pLTS: we show that the polynomial time procedure earlier proposed is erroneous and that in fact for all considered specifications, the problem is PSPACE-complete. We also establish tight bounds for the size of diagnosers. Afterwards we consider the dual notion of predictability which consists in predicting that in a safe run, a fault will eventually occur. Predictability is an easier problem than diagnosability: it is NLOGSPACE-complete. Yet the predictor synthesis is as hard as the diagnoser synthesis. Finally we introduce and study the more flexible notion of prediagnosability that generalizes predictability and diagnosability.
Fichier principal
Vignette du fichier
paper-90.pdf (505.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01088117 , version 1 (27-11-2014)


  • HAL Id : hal-01088117 , version 1


Nathalie Bertrand, Serge Haddad, Engel Lefaucheux. Foundation of Diagnosis and Predictability in Probabilistic Systems. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), Dec 2014, New Delhi, India. pp.417-429. ⟨hal-01088117⟩
235 View
172 Download


Gmail Facebook X LinkedIn More