Codiagnosability of discrete event systems revisited: A new necessary and sufficient condition and its applications

Automatica ◽  
2019 ◽  
Vol 101 ◽  
pp. 354-364 ◽  
Author(s):  
Gustavo S. Viana ◽  
João C. Basilio
2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Xuena Geng ◽  
Dantong Ouyang ◽  
Xiangfu Zhao

Because of the complexity of the failure diagnosis for large-scale discrete event systems (DESs), DESs with decentralized information have received a lot of attention. DESs with communication events are defined as distributed DESs. Stochastic discrete event systems (SDESs) are DESs with a probabilistic structure. A-diagnosability is an important property in failure diagnosis of SDES. In this paper, we investigate A-diagnosability in distributed SDESs. We define a local model and global model. Moreover, we construct a synchronized stochastic diagnoser to check A-diagnosability in distributed SDESs. We also propose a necessary and sufficient condition for a distributed SDES to be A-diagnosable. Some examples are described to illustrate our algorithms.


Author(s):  
Eric Gascard ◽  
Zineb Simeu-Abazi ◽  
Bérangère Suiphon

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.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Xiangfu Zhao ◽  
Gianfranco Lamperti ◽  
Dantong Ouyang ◽  
Xiangrong Tong

In the last several decades, the model-based diagnosis of discrete-event systems (DESs) has increasingly become an active research topic in both control engineering and artificial intelligence. However, in contrast with the widely applied minimal diagnosis of static systems, in most approaches to the diagnosis of DESs, all possible candidate diagnoses are computed, including nonminimal candidates, which may cause intractable complexity when the number of nonminimal diagnoses is very large. According to the principle of parsimony and the principle of joint-probability distribution, generally, the minimal diagnosis of DESs is preferable to a nonminimal diagnosis. To generate more likely diagnoses, the notion of the minimal diagnosis of DESs is presented, which is supported by a minimal diagnoser for the generation of minimal diagnoses. Moreover, to either strongly or weakly decide whether a minimal set of faulty events has definitely occurred or not, two notions of minimal diagnosability are proposed. Necessary and sufficient conditions for determining the minimal diagnosability of DESs are proven. The relationships between the two types of minimal diagnosability and the classical diagnosability are analysed in depth.


Sign in / Sign up

Export Citation Format

Share Document