Polynomial-time verification of diagnosability of fuzzy discrete event systems  

作　　者：LIU FuChun 

机构地区：[1]School of Computers,Guangdong University of Technology

出　　处：《Science China(Information Sciences)》2014年第6期270-279,共10页中国科学（信息科学）（英文版）

基　　金：supported by National Natural Science Foundation of China(Grant Nos.60974019,61273118);High-level Talents Project of Guangdong Province;Natural Science Foundation of Guangdong Province(Grant No.S2012010010570)

摘　　要：A fuzzy approach to perform diagnosis of fuzzy discrete event systems（FDESs）is proposed by constructing diagnosers,which may more effectively cope with the problems of vagueness and fuzziness arising from failure diagnosis of fuzzy systems.However,the complexity of constructing this kind of diagnosers is exponential in the state space and the number of fuzzy events of the system.In this paper,we present an algorithm for verifying the diagnosability of FDESs based on the construction of a nondeterministic automaton called F-verifier instead of diagnosers.Both the construction of F-verifiers and the verification of diagnosability of FDESs can be realized with a polynomial-time complexity.A fuzzy approach to perform diagnosis of fuzzy discrete event systems（FDESs）is proposed by constructing diagnosers,which may more effectively cope with the problems of vagueness and fuzziness arising from failure diagnosis of fuzzy systems.However,the complexity of constructing this kind of diagnosers is exponential in the state space and the number of fuzzy events of the system.In this paper,we present an algorithm for verifying the diagnosability of FDESs based on the construction of a nondeterministic automaton called F-verifier instead of diagnosers.Both the construction of F-verifiers and the verification of diagnosability of FDESs can be realized with a polynomial-time complexity.

关 键 词：discrete event systems fuzzy finite automata failure diagnosis polynomial complexity 

分 类 号：O159[理学—数学]