Skip to Main content Skip to Navigation
Conference papers

Predictability Analysis of Distributed Discrete Event Systems

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Lina Ye <>
Submitted on : Monday, December 16, 2013 - 5:26:42 PM
Last modification on : Tuesday, February 9, 2021 - 3:10:03 PM
Long-term archiving on: : Saturday, April 8, 2017 - 7:13:57 AM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads