A polynomial verification algorithm for safe diagnosability of fuzzy discrete-event systems

Author

Liu Fuchun ; Zhang Qiansheng ; Huang Renwei

Author_Institution

Sch. of Comput., Guangdong Univ. of Technol., Guangzhou, China

fYear

2014

fDate

28-30 July 2014

Firstpage

3915

Lastpage

3920

Abstract

In this paper, we investigate the verification issue for safe diagnosability of fuzzy discrete-event systems (FDESs). In order to guarantee that faults occurring in a safe diagnosable fuzzy system can be detected with a certain degree, and the detection may be completed before any unsafe behavior is executed, we construct a nondeterministic automaton, namely verifier, to check whether a certain forbidden operation is executed in the failed mode of fuzzy system. Then a necessary and sufficient condition for verifying the safe diagnosability of FDESs is proposed. It is illustrated that the verifier of an FDES can be constructed with a polynomial complexity, and the verification for its safe diagnosability can be realized within polynomial time.

Keywords

automata theory; computational complexity; discrete event systems; fault diagnosis; fuzzy systems; polynomials; FDES; failed mode; forbidden operation; fuzzy discrete-event systems; nondeterministic automaton; polynomial complexity; polynomial time; polynomial verification algorithm; safe diagnosability; Automata; Complexity theory; Discrete-event systems; Educational institutions; Fuzzy systems; Observability; Polynomials; Discrete-event systems; failure diagnosis; fuzzy automata; safe diagnosability; verification algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Control Conference (CCC), 2014 33rd Chinese

Conference_Location

Nanjing

Type

conf

DOI

10.1109/ChiCC.2014.6895592

Filename

6895592