Toward an Efficient Approach for Diagnosability ...
Type de document :
Communication dans un congrès avec actes
Titre :
Toward an Efficient Approach for Diagnosability Analysis of DES modeled by Labeled Petri Nets
Auteur(s) :
Liu, Baisi [Auteur]
Centrale Lille
Ghazel, Mohamed [Auteur]
Évaluation des Systèmes de Transports Automatisés et de leur Sécurité [IFSTTAR/COSYS/ESTAS]
Toguyeni, Armand [Auteur]
Centrale Lille
Centrale Lille
Ghazel, Mohamed [Auteur]
Évaluation des Systèmes de Transports Automatisés et de leur Sécurité [IFSTTAR/COSYS/ESTAS]
Toguyeni, Armand [Auteur]

Centrale Lille
Titre de la manifestation scientifique :
13th European Control Conference - ECC'2014
Pays :
France
Date de début de la manifestation scientifique :
2014-06-25
Titre de l’ouvrage :
13th European Control Conference - ECC'2014
Date de publication :
2014-01-01
Discipline(s) HAL :
Informatique [cs]/Automatique
Résumé en anglais : [en]
This paper deals with the diagnosability of discrete event systems (DES) modeled by labeled Petri nets (LPNs). An additional parameter K ∈ N, which is the number of observable events after an unobservable fault to ensure ...
Lire la suite >This paper deals with the diagnosability of discrete event systems (DES) modeled by labeled Petri nets (LPNs). An additional parameter K ∈ N, which is the number of observable events after an unobservable fault to ensure diagnosability, is discussed. With the incremental search of K, we transform the diagnosability problem into a series of K-diagnosability problems. For bounded diagnosable systems, Kmin , the minimum value of K to ensure diagnosability, can be eventually found. The state space is generated on the fly, without investigation of unnecessary states. This is a notable advantage compared with some existing methods, since just a part of the state space can often be sufficient to assess diagnosability.Lire moins >
Lire la suite >This paper deals with the diagnosability of discrete event systems (DES) modeled by labeled Petri nets (LPNs). An additional parameter K ∈ N, which is the number of observable events after an unobservable fault to ensure diagnosability, is discussed. With the incremental search of K, we transform the diagnosability problem into a series of K-diagnosability problems. For bounded diagnosable systems, Kmin , the minimum value of K to ensure diagnosability, can be eventually found. The state space is generated on the fly, without investigation of unnecessary states. This is a notable advantage compared with some existing methods, since just a part of the state space can often be sufficient to assess diagnosability.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Non spécifiée
Vulgarisation :
Non
Collections :
Source :