Predictability Analysis of Distributed Discrete Event Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Predictability Analysis of Distributed Discrete Event Systems


Predictability is an important system property that determines with certainty the future occurrence of a fault based on a model of the system and a sequence of observations. The existing works dealt with predictability analysis of discreteevent systems in the centralized way. To deal with this important problem in a more efficient way, in this paper, we first propose a new centralized polynomial algorithm, which is inspired from twin plant method for diagnosability checking and more importantly, is adaptable to a distributed framework. Then we show how to extend this algorithm to a distributed one, based on local structure. We first obtain the original predictability information from the faulty component, and then check its consistency in the whole system to decide predictability from a global point of view. In this way, we avoid constructing global structure and thus greatly reduce the search space.
Fichier principal
Vignette du fichier
sample.pdf (154.02 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00919434 , version 1 (16-12-2013)


  • HAL Id : hal-00919434 , version 1


Lina Ye, Philippe Dague, Farid Nouioua. Predictability Analysis of Distributed Discrete Event Systems. 52nd IEEE Conference on Decision and Control, Dec 2013, Florence, Italy. pp.5009-5015. ⟨hal-00919434⟩
713 View
247 Download


Gmail Mastodon Facebook X LinkedIn More