A Polynomial Algorithm for Diagnosability Analysis of Discrete Event Systems

E. Gascard 1 Zineb Simeu-Abazi 1 Bérangère Suiphon 1
1 G-SCOP_GCSP - GCSP
G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production
Abstract : The paper deals with the definition of procedure that enables one to determine, for a given plant, if all faults can be detected and located after a finite sequence of observable events. More formally, the diagnosability is the property that every fault can be correctly detected from the observable events of the system after its occurrence no later than a bounded number of events. In this paper, the diagnosability problem of Discrete Event Systems (DESs) is studied. As modeling tool, finite-state automaton in an event-based framework is used. A necessary and sufficient condition of diagnosability of such systems is proposed. The results proposed in this paper allow checking the diagnosability of discrete event systems in an efficient way, i.e. in polynomial time.
Type de document :
Article dans une revue
International Journal of Adaptive, Resilient and Autonomic Systems (IJARAS), IGI Global, 2015, Special Issue on Complex Systems 6 (2), pp.1-22. 〈http://www.igi-global.com/journal/international-journal-adaptive-resilient-autonomic/1154〉. 〈10.4018/IJARAS.2015070101〉
Liste complète des métadonnées

http://hal.univ-grenoble-alpes.fr/hal-01376279
Contributeur : Eric Gascard <>
Soumis le : mardi 4 octobre 2016 - 16:07:22
Dernière modification le : mercredi 29 août 2018 - 09:44:01

Identifiants

Collections

Citation

E. Gascard, Zineb Simeu-Abazi, Bérangère Suiphon. A Polynomial Algorithm for Diagnosability Analysis of Discrete Event Systems. International Journal of Adaptive, Resilient and Autonomic Systems (IJARAS), IGI Global, 2015, Special Issue on Complex Systems 6 (2), pp.1-22. 〈http://www.igi-global.com/journal/international-journal-adaptive-resilient-autonomic/1154〉. 〈10.4018/IJARAS.2015070101〉. 〈hal-01376279〉

Partager

Métriques

Consultations de la notice

101