Learning Diagnosis Based on Evolving Fuzzy Finite State Automaton
نویسندگان
چکیده
Nowadays, determining faults (or critical situations) in nonstationary environment is a challenging task in complex systems such as Nuclear center, or multi-collaboration such as crisis management. A discrete event system or a fuzzy discrete event system approach with a fuzzy role-base may resolve the ambiguity in a fault diagnosis problem especially in the case of multiple faults (or multiple critical situations). The main advantage of fuzzy finite state automaton is that their fuzziness allows them to handle imprecise and uncertain data, which is inherent to real-world phenomena, in the form of fuzzy states and transitions. Thus, most of approaches proposed for fault diagnosis of discrete event systems require a complete and accurate model of the system to be diagnosed. However, in non-stationary environment it is hard or impossible to obtain the complete model of the system. The focus of this work is to propose an evolving fuzzy discrete event system whose an activate degree is associated to each active state and to develop a fuzzy learning diagnosis for incomplete model. Our approach use the fuzzy set of output events of the model as input events of the diagnoser and the output of a fuzzy system should be defuzzified in an appropriate way to be usable by the environment.
منابع مشابه
MINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES
In this paper, relations among the membership values of gener- alized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized nite automaton with vague ( final) states for any vague regular language recog...
متن کاملDISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...
متن کاملFUZZY PREORDERED SET, FUZZY TOPOLOGY AND FUZZY AUTOMATON BASED ON GENERALIZED RESIDUATED LATTICE
This work is towards the study of the relationship between fuzzy preordered sets and Alexandrov (left/right) fuzzy topologies based on generalized residuated lattices here the fuzzy sets are equipped with generalized residuated lattice in which the commutative property doesn't hold. Further, the obtained results are used in the study of fuzzy automata theory.
متن کاملAn AsmL model for an Intelligent Vehicle Control System
An abstract state machine (ASM) is a mathematical model of the system’s evolving, runtime state. ASMs can be used to faithfully capture the abstract structure and step-wise behaviour of any discrete systems. An easy way to understand ASMs is to see them as defining a succession of states that may follow an initial state. We present a machine-executable model for an Intelligent Vehicle Control S...
متن کاملA NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA
In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...
متن کامل