Fuzzy Reasoning Numerical Spiking Neural P Systems for Induction Motor Fault Diagnosis

The fuzzy reasoning numerical spiking neural P systems (FRNSN P systems) are proposed by introducing the interval-valued triangular fuzzy numbers into the numerical spiking neural P systems (NSN P systems). The NSN P systems were applied to the SAT problem and the FRNSN P systems were applied to induction motor fault diagnosis. The FRNSN P system can easily model fuzzy production rules for motor faults and perform fuzzy reasoning. To perform the inference process, a FRNSN P reasoning algorithm was designed. During inference, the interval-valued triangular fuzzy numbers were used to characterize the incomplete and uncertain motor fault information. The relative preference relationship was used to estimate the severity of various faults, so as to warn and repair the motors in time when minor faults occur. The results of the case studies showed that the FRNSN P reasoning algorithm can successfully diagnose single and multiple induction motor faults and has certain advantages over other existing methods.


Introduction
Induction motors are widely used to drive various mechanical and industrial equipment. The major components of an induction motor are usually stators, rotors, air gaps and bearings [1,2]. Due to their heavy workload and harsh working environment, induction motors are prone to various hidden troubles during operations. The occurrence of faults usually causes huge economic losses, so it is necessary to detect faults early, prevent the occurrence and development of faults and prevent the occurrence of destructive and catastrophic accidents [3][4][5]. The fault diagnosis of induction motors generally consists of two processes including state detection and diagnosis. Specifically, by monitoring and analyzing its relevant operating parameters, the current operating state of an induction motor is evaluated to determine whether a fault exists. If it is in a fault state, the location, severity and development trend of the fault need to be clarified [6,7].
In recent years, motor fault diagnosis methods based on artificial neural networks [8][9][10][11] have become a research hotspot. Mejia-Barron et al. [12] proposed a multi-layer neural network-based model to reproduce the current characteristics associated with inter-turn short circuit fault conditions, providing a new tool for testing and monitoring the induction motor working conditions. Deng et al. [11] proposed a new method for bearing fault diagnosis based on empirical wavelet transform, fuzzy entropy and support vector machines. Kumar and Hati [6] proposed a new detection technique for bearing faults and broken rotor bars of squirrel-cage induction motors based on an extended convolutional neural network model. Although neural networks can be used to find solutions according to the faults that need to be resolved, they also have obvious disadvantages, such as the need to learn from a large number of samples, slow convergence and serious local optimal solutions [13]. In 1.
The NSN P system, as a combination of the SNP system and the NP system, is applied to motor fault diagnosis for the first time. In order to prove its ability to deal with induction motor fault diagnosis, the NSN P system is used to solve the SAT problem first. The results show that the NSN P system can successfully solve the SAT problem in six steps; 2.
The IVTFNs are applied to the NSN P system, and the FRNSN P system is proposed to deal with the incompleteness and uncertainty of motor fault information. The FRNSN P system can successfully model the fault fuzzy production rules of induction motors; 3.
A FRNSN P reasoning algorithm is designed by using the operating mechanism of FRNSN P systems, making the motor fault diagnosis intelligent; Entropy 2022, 24, 1385 3 of 21 4. The relative preference relationship is used to estimate the severity of multiple faults when they occur, so as to diagnose the faults in a timely manner and to prevent the deterioration of the faults.
The rest of this paper is organized as follows. Section 2 provides preliminaries on the IVTFNs and the relative preference relations. Section 3 presents the NSN P systems, shows a computational example, and gives the definition of the FRNSN P systems. Section 4 describes the fuzzy reasoning process of the FRNSN P systems and designs the FRNSN P reasoning algorithm. Section 5 reports the computational results to show the effectiveness of the FRNSN P reasoning algorithm for fault diagnosis of induction motors.

The Interval-Valued Triangular Fuzzy Number
An IVTFN is defined as A = A L A U = a L l , a L h , a L r ; w L A , a U l , a U h , a U r ; w U A , where A L and A U represent the lower and upper limits of A and A L ⊆ A U . When w L A = w U A = 1 and a L h = a U h , the form of A becomes A = A L , A U = a U l , a L l , a L h = a U h , a L r , a U r = a U l , a L l , a h , a L r , a U r , which is called a normalized IVTFN (NIVTFN). An NIVTFN is shown in Figure 1, where µ A (x) is the membership function representing the degree of the membership of x, and µ A L (x) and µ A U (x) are the lower and the upper bounds of µ A (x) [31].
FRNSN P system can successfully model the fault fuzzy production rules of induction motors; 3. A FRNSN P reasoning algorithm is designed by using the operating mechanism of FRNSN P systems, making the motor fault diagnosis intelligent; 4. The relative preference relationship is used to estimate the severity of multiple faults when they occur, so as to diagnose the faults in a timely manner and to prevent the deterioration of the faults.
The rest of this paper is organized as follows. Section 2 provides preliminaries on the IVTFNs and the relative preference relations. Section 3 presents the NSN P systems, shows a computational example, and gives the definition of the FRNSN P systems. Section 4 describes the fuzzy reasoning process of the FRNSN P systems and designs the FRNSN P reasoning algorithm. Section 5 reports the computational results to show the effectiveness of the FRNSN P reasoning algorithm for fault diagnosis of induction motors.
In the above relative preference relationship, the coefficients p and 1 − p are the weights of the lower interval A L and the upper interval A U , respectively. The value of p, called the relative preference relation value, is generally determined subjectively, and several different values are usually considered. A good relative preference relationship has a value of p close to 1, and a poor relative preference relationship has a value of p close to 0. Therefore, the relative merits of IVTFNs in a specific set can be quickly judged by the relative preference relation value p [13,31,32].

The NSN P System and Its Extension to the FRNSN P System
The NSN P systems are described and their computational power is demonstrated by solving SAT problems. The FRNSN P system is then defined by introducing the IVTFNs into the NSN P system, which lays the foundation for fault diagnosis of induction motors.

The NSN P System
The NSN P system, described in detail below, has a slightly different threshold from that used in the literature [30,33]. An NSN P system is defined as a tuple as shown in (2) below: where l ≥ 1 is the degree of the NSN P system. The notations in this definition are given below.
(1) σ 1 , σ 2 , . . . , σ l represent l neurons with the form σ k = (θ k , Var k , Pr k , Var k (0)), Pr k = pr P,k = F P,k x 1,k , . . . , x h k ,k 1 ≤ P ≤ h k is a set of programs, where F is called a production function in neuron σ k , where h k is the number of programs in σ k .
(3) in and out correspond to the input neuron σ in and the output neuron σ out , respectively. In NSN P system Π, x w,k and pr P,k represent variable w and program P in neuron σ k , respectively. When neuron σ k has only one variable or only one program, w or P is omitted from the subscripts. At time t, the value of variable x w,k is represented by x w,i (t) and the production value of program pr P,k is represented by pr P,k (t) = F P,k x 1,k (t), . . . , x h k ,k (t) , i.e., the production value pr P,k (t) is determined by the values of the variables x 1,k , . . . , x h k ,k at time t. Each neuron in Π has a threshold θ k , and program pr P,k will be applied only when pr P,k (t) ≥ θ k . Once pr P,k is applied, meaning neuron σ k fires, the values of the variables x 1,k , . . . , x h k ,k are reset to 0 and pr P,i (t) is simultaneously transmitted to the variables of the postsynaptic neurons of neurons σ k . If pr P,k (t) < θ k , neuron σ k will not fire and pr P,k (t) will disappear at this moment.
If the sum of the production values received by variable x w,k at time t is pr(t), then x w,k (t + 1) is updated according to (3) in the following: if the application of program pr P,k involves variable x w,k pr(t) + x w,k (t), if the application of program pr P,k does not involve variable x w,k All neurons work in parallel in the NSN P system, and each neuron applies one program at most at each moment. If more than one program can be applied, only one can be selected non-deterministically.

An Application to the SAT Problem
A SAT problem checks whether the variables of a given Boolean formula can be consistently replaced with the values TRUE and FALSE such that the formula evaluates to TRUE. The instances of SAT problems are determined by two parameters m and n representing the numbers of clauses and variables, respectively. Given a set of Boolean variables Q = {q 1 , q 2 , . . . , q n }, a clause C can be expressed in the form q 1 (¬q 1 ) ∨ · · · ∨ q i (¬q i ) ∨ · · · ∨ q n (¬q n ), where ∨ indicates the disjunction. A q i = 1 means that q i is assigned a true value. In general, if q i = 1, then ¬q i = 0, and if q i = 0, then ¬q i = 1. As long as a variable in C is given a true value, C is assigned a value of 1, meaning C is satisfiable. The SAT problem is stated as: . . , C m }, constructed from a finite set {q 1 , q 2 , . . . , q n } of Boolean variables.
TASK: Find if there is an assignment of the variables q 1 , q 2 , . . . , q n satisfying all the clauses in C.
When the assignment of the variables satisfies all the clauses, C is satisfiable and each clause C j , for 1 ≤ j ≤ m, is given a value of 1. In the following, the SAT problems are solved uniformly with a family of NSN P systems.
The NSN P systems, working non-deterministically, can solve the SAT problem in finite time steps. The general structure of the NSN P systems is shown in Figure 2, with modules Q i , for 1 ≤ i ≤ n, and Y j , for 1 ≤ j ≤ m, corresponding to variables q i and clauses C j , respectively. Each module Q i has three synapses connected to module Y j . When the assignment of the variables satisfies all the clauses,  is satisfiable and each clause j C , for 1 j m ≤ ≤ , is given a value of 1. In the following, the SAT problems are solved uniformly with a family of NSN P systems. The NSN P systems, working non-deterministically, can solve the SAT problem in finite time steps. The general structure of the NSN P systems is shown in Figure 2, with modules i Q , for 1 i n ≤ ≤ , and j Y , for 1 j m ≤ ≤ , corresponding to variables i q and clauses j C , respectively. Each module i Q has three synapses connected to module j Y . The following method is used to encode a given SAT instance in order to obtain a uniform solution. A propositional formula is considered in the conjunctive normal form, where ∧ indicates the conjunction. Since variable i q may or may not appear in a clause j C and can or cannot be negated when it appears, two bits binary numbers are used to code the relationship between i q and j C with 00 indicating i q not appearing in j C , 01 or equivalently 10 indicating i q appearing in j C , and 11 indicating i q ¬ appearing in j C . Each clause corresponds to an input neuron, and a sequence of 2n digits of 0 s and 1 s is introduced into the input neuron to describe the clause. Therefore, 2n steps are The following method is used to encode a given SAT instance in order to obtain a uniform solution. A propositional formula γ = C 1 ∧ C 2 ∧ . . . ∧ C m is considered in the conjunctive normal form, where ∧ indicates the conjunction. Since variable q i may or may not appear in a clause C j and can or cannot be negated when it appears, two bits binary numbers are used to code the relationship between q i and C j with 00 indicating q i not Entropy 2022, 24, 1385 6 of 21 appearing in C j , 01 or equivalently 10 indicating q i appearing in C j , and 11 indicating ¬q i appearing in C j .
Each clause corresponds to an input neuron, and a sequence of 2n digits of 0 s and 1 s is introduced into the input neuron to describe the clause. Therefore, 2n steps are required to input the code of the clause with n variables. For example, γ = (¬q 1 ∨ q 2 ) ∧ (q 1 ∨ ¬q 3 ) is a propositional formula composed of clauses C 1 = ¬q 1 ∨ q 2 and C 2 = q 1 ∨ ¬q 3 , and the sequences 110100 and 010011 corresponding to clauses C 1 and C 2 will be introduced into the associated input neurons within six steps, respectively.
Module Q i is shown in Figure 3. The neurons σ c 1 , σ c 2 , σ c 3 and σ c 4 in each module Q i are allowed to appear only once in order to reduce the computational complexity. Initially only variable x c 1 of neuron σ c 1 is assigned a value of 1. Module Q i non-deterministically produces a truth assignment for variable q i by non-deterministically choosing a program between Pr 1,d i = x d i and Pr 2,d i = x d i − 1 in neuron σ d i . Neuron σ e i will fire if program Pr 1,d i = x d i is applied and will not fire if program Pr 2,d i = x d i − 1 is applied. In this way, neuron σ e i transmits the value of 1 or nothing to neuron σ z j in module Y j . Then q i is assigned the true value if the value of 1 is transmitted. In addition to feeding neuron σ d i , neuron σ c 1 initially transmits a value of 1 to neuron σ c 2 . This value is transmitted along the   Delay neurons labeled σ f and σ g are used to maintain the synchronization of the transmission, i.e., neuron σ z j receives the value from module Q i and the value from the input neuron associated with clause C j simultaneously. For example, module Q 1 does not need delay neurons and module Q 2 needs two delay neurons per row. By analogy, each row of module Q i needs i − 1 pairs of delay neurons to guarantee synchronization. Therefore, in step 1 + 2i, neuron σ z j receives the assignment of variable q i and the value from the input neuron. Further processing will be carried out in module Y j , as shown in Figure 4.
In steps 3, 5, . . . , 2n + 1, neuron σ z j may receive the following values: 2 if q i = 0, but q i and ¬q i do not appear in C j , 3 if q i = 1, but q i and ¬q i do not appear in C j , 3 if q i = 0, but q i appears and ¬q i does not appear in C j , 4 if q i = 1, but q i appears and ¬q i does not appear in C j , 4 if q i = 0, but ¬q i appears and q i does not appear in C j , 5 if q i = 1, but ¬q i appears and q i does not appear in C j .
Program Pr z = 1 4 x z in neuron σ z j will be activated and will produce a value of 1 in two cases, one is when q i = 1 and q i appears in C j and the other is when q i = 0 and ¬q i appears in C j . In either case, the assignment of variable q i satisfies clause C j . Neuron σ z j is used to ensure that σ z j fires only once by passing the production value −5 to variable x z j . In this way, it also ensures that variable x out receives a value of 1 at most once.
In step 2i + 2, if all clauses are satisfied, the sum of the values received by variable x out is m, and neuron σ out fires. So far, it shows that there is a variable assignment so that the proposition formula γ is satisfiable. Therefore, NSN P systems, containing a total of 6n 2 − n + 2m + 1 neurons working non-deterministically, can solve the SAT problem in finite time steps.
Delay neurons labeled f σ and g σ are used to maintain the synchronization of the transmission, i.e., neuron j z σ receives the value from module i Q and the value from the input neuron associated with clause j C simultaneously. For example, module 1 Q does not need delay neurons and module 2 Q needs two delay neurons per row. By analogy, each row of module i Q needs 1 i − pairs of delay neurons to guarantee synchronization. Therefore, in step 1 2i + , neuron j z σ receives the assignment of variable i q and the value from the input neuron. Further processing will be carried out in module j Y , as shown in Figure 4. The computation time can be shortened by using more input neurons after modifying modules Y j , j = 1, 2, . . . , m. The structure of the modified module Y j is shown in Figure 5. The modified module Y j uses n input neurons to introduce the binary code of a clause in two steps instead of bit by bit in one input neuron. Each of these n neurons receives a two bit binary number 00, 01 (or 10) or 11. When receiving a value of 1, the input neuron σ in j,i will fire and transmit a value of 1 to neurons σ z j,i , 1 ≤ i ≤ n and 1 ≤ j ≤ m. Neurons σ z j,i and σ z in module Y j have similar structures and perform the same functions, i.e., checking whether the assignment of variable q i satisfies clause C j . x is m , and neuron out σ fires. So far, it shows that there is a variable assignment so that the proposition formula γ is satisfiable. Therefore, NSN P systems, containing a total of 2 6 2 1 n n m − + + neurons working non-deterministically, can solve the SAT problem in finite time steps.
The computation time can be shortened by using more input neurons after modifying modules j Y , 1, 2, , j m =  . The structure of the modified module j Y is shown in Figure  5. The modified module j Y uses n input neurons to introduce the binary code of a clause in two steps instead of bit by bit in one input neuron. Each of these n neurons receives a two bit binary number 00, 01 (or 10) or 11. When receiving a value of 1, the input neuron   The delay neurons σ f and σ g in module Q i are no longer needed while all other parts remain unchanged. In step 3, module Q i , for 1 ≤ i ≤ n, also transmits values of 2 or 3 to all neurons σ z j,i . All variables and all clauses are then checked in parallel. In step 4, if the assignment of variable q i satisfies clause C j , the program in neuron σ z j,i will be enabled. As a result, variable x j of neuron σ j may receive values of 1, 2, . . . , n. No matter which value σ j receives, program Pr 1,j = x j will be enabled in step 5 due to the values of the threshold θ j = 1, 2, . . . , n.
The firing of neuron σ j shows that C j is satisfiable. Each neuron σ j is connected to neuron σ out . In step 6, if the sum of the values received by neuron σ out is m, the assignments of variables q 1 , q 2 , . . . , q n all satisfy the clauses in C. At the same time, program Pr out = 1 m x out is applied and neuron σ out fires. Obviously, the SAT problem is solved in six steps. With the modified modules Y j , the NSN P systems use a total of 2nm + m + 2n + 5 neurons. The computation time is greatly reduced compared to the system with the original modules Y j although it is not clear about how many more neurons are needed.
To show the computational power of the NSN P system, its time steps for solving the SAT problem are compared with those of DDSN P systems [34], WSN P systems [35] and SN P systems with neuron division and budding [36]. The comparisons are shown in Table 1. Obviously, the NSN P system can solve the SAT problem with the fewest steps.

Definition of the FRNSN P System
The FRNSN P system is presented in this subsection as an extension of the NSN P system. A fuzzy reasoning numerical spiking neural P (FRNSN P) system of degree m is defined in (4) as follows Π = (γ, syn, in, out) where γ = γ p ∪ γ r = {σ 1 , . . . , σ l } is a set of l neurons, with γ p = {σ 1 , . . . , σ s } representing the set of proposition neurons and γ r = {σ s+1 , . . . , σ s+n } representing the set of rule neurons, such that l = s + n. Each proposition neuron has the form of σ i = (θ i , x i , Pr i , x i (0)), for 1 ≤ i ≤ s, and each rule neuron has the form of σ j = θ j , c j , x j , Pr j , x j (0) , for 1 ≤ j ≤ n.
The details of the notations in the definition of Π are given below.
(1) (a) θ k ∈ Ψ is the firing threshold of neuron σ k , for 1 ≤ k ≤ l; (b) c j ∈ Ψ indicates the confidence factor of neuron σ j , for 1 ≤ j ≤ n. (c) x k is the variable of neuron σ k , for 1 ≤ k ≤ l; (d) x k (0) is the initial fuzzy value of variable x k , for 1 ≤ k ≤ l.
, is a set of programs, where F is called the production function, for 1 ≤ k ≤ l. In the FRNSN P system, each neuron contains only one variable and one program, each threshold θ k , each confidence factor c j or the initial value of the variable x k is an NIVTFN and each program has only two special forms pr k = x k and pr k = x k c j . Everything else in the FRNSN P system is the same as that in the NSN P system.
For convenience and intuition, NIVTFNs are associated with some linguistic semantics. The linguistic semantics used in this work are widely used in the literature [13,15,31] and are shown in Table 2. These linguistic semantics vividly reflect the probability that an event occurs.

Linguistic Terms NIVTFNs
Extremely In addition, the following arithmetic and logic operations, involved in the operations of the FRNSN P system, are defined. Premise: are two NIVTFNs, with a and b being real numbers in the interval [0, 1].
Given the above premise, the following arithmetic operation is defined: Given the above premise, the following logical operations are defined: (1) And:

The FRNSN P Reasoning Algorithm
This section first uses the FRNSN P system to model the fuzzy production rules of the induction motors, and then proposes the FRNSN P reasoning algorithm based on the reasoning process of the FRNSN P system.

Modeling and Fuzzy Reasoning
Fuzzy production rules are usually used for knowledge representation, and the following three types of fuzzy production rules are involved in this work: General rule R j : IF p 1 , THEN p 2 C = c j ; And rule R j : IF p 1 AND p 2 AND . . . AND p s−1 , THEN p s C = c j ; Or rule R j : IF p 1 OR p 2 OR . . . OR p s−1 , THEN p s C = c j ; where p 1 , . . . , p s are fuzzy propositions, and C = c j represents the credibility of the fuzzy production rule R j . The FRNSN P system is used to model the above three types of fuzzy production rules. Four types of, i.e., proposition, G-rule, A-rule and O-rule, neurons, as shown in Figure 6, are used in the FRNSN P systems. A proposition neuron represents a fuzzy proposition. The G-rule, A-rule and O-rule neurons represent the three types of rules, as discussed below. The General rule is modeled by FRNSN P system 1 Π shown in Figure 7 1 ( ) Π . System 1 Π is specified in (5)  , , , , , syn in out The details of the notations used in system 1 Π are given below. (1) θ is a proposition neuron representing fuzzy propositions i p The General rule is modeled by FRNSN P system Π 1 shown in Figure 7 (Π 1 ). System Π 1 is specified in (5) as follows  The fuzzy reasoning process is automatically performed as follows. Initially, the var iable of neuron 1 σ is assigned a value of ( )   The details of the notations used in system Π 1 are given below.
The fuzzy reasoning process is automatically performed as follows. Initially, the variable of neuron σ 1 is assigned a value of x 1 (0). Neuron σ 1 fires and the variable of neuron σ 3 receives the production value pr 1 (0) if pr 1 (0) = x 1 (0) ≥ θ 1 , or does not fire and the value pr 1 (0) disappears otherwise, at time t = 0. When rule neuron σ 3 satisfies the firing condition, it fires and transmits the production value of pr 3 (1) = x 3 (1)c 3 = x 1 (0)c 3 to variable x 2 at time t = 1. Thus, the value x 1 (0)c 3 is the result of the computation of system Π 1 .
The AND rule is modeled by FRNSN P system Π 2 shown in Figure 7 (Π 2 ). System Π 2 is specified in (6) as follows The details of the notations used in system Π 2 are given below.
The fuzzy reasoning process of system Π 3 is similar to that of system Π 2 , and its description is omitted.

The FRNSN P Reasoning Algorithm
This subsection introduces the FRNSN P reasoning algorithm, as detailed in Algorithm 1. The related matrices, vectors and multiplication operators, as well as a function, are introduced first. The flowchart of the FRNSN P reasoning algorithm is then presented.
(1) X p (t) = (x 1 (t), . . . , x s (t)) T is a vector consisting of the fuzzy values of the s variables contained in the s proposition neurons, where x i (t) is an NIVTFN, for 1 ≤ i ≤ s; (2) X r (t) = (x 1 (t), . . . , x n (t)) T is a vector consisting of the fuzzy values of the n variables contained in the n rule neurons, where x j (t) is an NIVTFN, for 1 ≤ j ≤ n; (3) Θ = (θ 1 , . . . , θ l ) T is a vector consisting of the l firing thresholds of the l neurons, where θ k is an NIVTFN, for 1 ≤ k ≤ l; (4) C = diag(c 1 , . . . c n ) is a diagonal matrix consisting of the confidence factors of the n rule neurons, where c j , for 1 ≤ j ≤ n, is the confidence factor of neuron σ j , an NIVTFN, representing the credibility of the fuzzy production rule R j ; is a matrix representing the synaptic connections from proposition neurons to G − rule neurons, such that d (1) ij = 1 if a synapse exists from proposition neuron σ i to G − rule neuron σ j , and d (1) ij = 0 otherwise, for 1 ≤ i ≤ s and 1 ≤ j ≤ n; is a matrix representing the synaptic connections from proposition neurons to A − rule neurons, such that d (2) ij = 1 if a synapse exists from proposition neuron σ i to A − rule neuron σ j , and d (2) ij = 0 otherwise, for 1 ≤ i ≤ s and 1 ≤ j ≤ n; (7) D 3 = d ij = 0 otherwise, for 1 ≤ i ≤ s and 1 ≤ j ≤ n; (8) E = e ji n×s is a matrix representing the synaptic connections from rule neurons to proposition neurons such that e ji = 1 if a synapse exists from rule neuron σ j to proposition neuron σ j , and e ji = 0 otherwise, for 1 ≤ i ≤ s and 1 ≤ j ≤ n; T is a vector consisting of the values passed by proposition neuron σ i to the postsynaptic rule neuron variable. If neuron σ i does not have a postsynaptic neuron, then this value is passed to the environment as the output value.
In addition, several multiplication operators for the above matrices and vectors are defined: (1) C ⊗ X r (t) = (c 1 x 1 (t), . . . , c n x n (t)) T . Similarly, sj x s (t), for 1 ≤ j ≤ n; sj x s (t), for 1 ≤ j ≤ n; Finally, a function (8) for production value pr k (t) and threshold θ is defined.
for each of the (input) proposition neurons do 5.
if the proposition neuron has a postsynaptic rule neuron then 6. Calculate if pr i (t) ≥ θ i then 8.
Transmits the value v pi (t) to the rule neuron; 9. else 10.
Transmits the value 0 to the rule neuron; 11. end if 12.
end if 13. end for 14.
for each of the rule neurons do 15.
Transmits the value v rj (t) to the postsynaptic proposition neuron; 17.
Calculate X p (t) = E T ⊕ (C ⊗ V r (t)); 18. Matrices Θ, C and X p (0) were obtained from expert experience and historical data, and matrices D 1 , D 2 , D 3 and E were obtained from the topology of the FRNSN P system. The flowchart of the FRNSN P reasoning algorithm is shown in Figure 8.

Fault Diagnosis of Induction Motors Using the FRNSN P Reasoning Algorithm
The fault mechanism of induction motors is complex, and the relationship between fault and a symptom is not one-to-one correspondent but is complex. Generally, a fau manifests as multiple symptoms and different faults may correspond to the same symp tom [37][38][39]. The faults of induction motors are mostly related to windings, bearings an rotors. The single-fault cases "Winding insulation burnt", "Bearing damage" and "Broke rotor bar", and the multiple-fault cases "Winding insulation burnt and bearing damage and "Bearing damage and broken rotor bar", as listed in Table 3, were investigated usin Algorithm 1. Due to the similarity of the reasoning processes, the multi-fault case "Wind ing insulation burnt and bearing damage" is used as an example for detailed description A flowchart showing the induction motor fault diagnosis process is in Figure 9.

Fault Diagnosis of Induction Motors Using the FRNSN P Reasoning Algorithm
The fault mechanism of induction motors is complex, and the relationship between a fault and a symptom is not one-to-one correspondent but is complex. Generally, a fault manifests as multiple symptoms and different faults may correspond to the same symptom [37][38][39]. The faults of induction motors are mostly related to windings, bearings and rotors. The single-fault cases "Winding insulation burnt", "Bearing damage" and "Broken rotor bar", and the multiple-fault cases "Winding insulation burnt and bearing damage" and "Bearing damage and broken rotor bar", as listed in Table 3, were investigated using Algorithm 1. Due to the similarity of the reasoning processes, the multi-fault case "Winding insulation burnt and bearing damage" is used as an example for detailed description. A flowchart showing the induction motor fault diagnosis process is in Figure 9.

Fuzzy Production Rules for Induction Motors
The fuzzy production rules related to motor faults are presented and the relevant fault events are enumerated, as shown in Figure 10 [37,38,40]. There is a one-to-one correspondence between fault events and propositions in fuzzy production rules. Fault events 36, 37 and 38 are the immediate causes of "motor fault", and the motor is considered faulty whichever of the three faults occurs. The events in bold in Figure 10 , σ σ σ σ σ σ σ σ σ σ σ σ σ σ σ σ FRNSN P 36 37 , σ σ , σ σ σ σ σ σ σ σ σ σ σ σ σ σ Figure 9. The flowchart of induction motor fault diagnosis process using Algorithm 1.

Defining the FRNSN P system
Defining the FRNSN P system

Defining the FRNSN P system
Modeling fuzzy production rules for induction motors using the FRNSN P system Defining the FRNSN P system Fuzzy reasoning   Figure 10. Fault events related to motor faults.

Parameter Settings
The

Parameter Settings
The relevant parameters of the FRNSN P reasoning algorithm are specified in this subsection. The confidence factors c j for 1 ≤ j ≤ n of the O-rule neurons, the G-rule neurons and the A-rule neurons were set to EH = [(1.00, 1.00), 1.00, (1.00, 1.

Case Studies
In this subsection, the potential fault of the motor is modeled using the fuzzy production rules, as shown in Figure 11. The fault diagnosis of the motor was carried out through Algorithm 1. Specifically, fault diagnosis contains two phases. The first phase is forward reasoning, which is to infer whether the motor will fail according to the probability of occurrence of failure events. The second phase is backward reasoning, that is to infer the fault cause and fault path of the motor after determining the motor fault. Suppose that the fault symptom events 2, 3, 5, 6, 8, 9, 10 and 13 occurred according to the online monitoring system, indicating that the initial NIVTFNs of the variables in neurons σ 2 , σ 3 , σ 5 , σ 6 , σ 8 , σ 9 , σ 10 and σ 13 are all greater than or equal to FH as defined in Table 2.
Entropy 2022, 24, x FOR PEER REVIEW 19 of 25 Figure 11. The forward reasoning model for induction motor fault diagnosis using the FRNSN P system.

Forward Reasoning
The threshold vector Θ and the confidence factor matrix C were presented in Section 5.2. The synaptic connection matrices 1 D , 2 D , 3 D and E are given in the topological structure of the FRNSN P system in Figure 11. The initial IVTFNs of the variables of the input proposition neurons, i.e., the probabilities of occurrences of fault symptom  Figure 11. The forward reasoning model for induction motor fault diagnosis using the FRNSN P system.

Forward Reasoning
The threshold vector Θ and the confidence factor matrix C were presented in Section 5.2. The synaptic connection matrices D 1 , D 2 , D 3 and E are given in the topological structure of the FRNSN P system in Figure 11. The initial IVTFNs of the variables of the input proposition neurons, i.e., the probabilities of occurrences of fault symptom events, were obtained according to the historical data and the experienced fault diagnosis reports in the industry [39,40].
The detailed process of forward reasoning using the FRNSN P system in Figure 11 is as follows. Initially only the variables of the input proposition neurons contain nonzero values. A 0 represents a vector of 0 s, i.e., the NIVTFNs in the neurons are [(0, 0), 0, (0, 0)]. An input proposition neuron fires and passes the production value to the rule neurons if it satisfies the threshold condition and does not fire and the contained production value disappears otherwise. The neurons in Figure 11 fire hierarchically and the production values are passed from presynaptic to postsynaptic neurons. According to the fuzzy reasoning process of the three FRNSN P systems in Section 4.1, the values of the variables, represented by the NIVTFNs, in the neurons at each time step are as follows.

Backward Reasoning
After the induction motor is determined to be faulty, the computation results of the FRNSN P reasoning algorithm are used to perform backward reasoning to find out the fault event, fault source and the fault propagation path. The backward reasoning model is shown in Figure 12.  39 }, L 5 = {σ 8 → σ 21 → σ 32 → σ 37 → σ 39 } and L 6 = {σ 9 → σ 21 → σ 32 → σ 37 → σ 39 }. It can be found that the fault events 2, 10 and 13 cannot ultimately lead to motor failure even if they also occur, i.e., they are not fault sources for motor failure.
Next, the severity of "Winding insulation burnt" and "Bearing failure" are determined by computing the relative preference values for proposition neurons σ 37 and σ 38 . Let Due to the relative preference value µ β A 1 , A > µ β A 2 , A , the fault of "Winding insulation burnt" is more serious. When multiple faults occur in the motor, the introduction of the relative preference relation β can help determine the severities of all the faults.
Finally, the performance of the FRNSN P system was compared with those of other motor fault diagnosis methods. The methods used for comparison were FFPN [37], CLPSO-FPN [38] and rMFRSNPs [40], and the comparison results are shown in Table 3. Fault events, fault symptoms, fault sources and fault cases are represented by corresponding neurons.
For the single-fault cases "Winding insulation burnt" and "Broken rotor bar", FFPN [37], CLPSO-FPN [38], rMFRSNPs [40] and FRNSN P could correctly detect the fault events and obtain the same fault sources and fault causes. The fault event of case 3 was "Bearing damage". Although all four methods could obtain the correct detection results, FFPN [37] and CLPSO-FPN [38] found one more fault source, i.e., neuron σ 9 , than rMFRSNPs [40] and FRNSN P did.
For the multi-fault case "Bearing damage and broken rotor bar", CLPSO-FPN [38], rMFRSNPs [40] and FRNSN P gave correct and consistent results, but FFPN [37] could only detect one of the faults, i.e., "Broken rotor bar". For the multi-fault case "Winding insulation burnt and bearing damage" detailed in this subsection, FRNSN P showed certain advantages, i.e., it could correctly detect faults "Winding insulation burnt" and "Bearing damage", but FFPN [37] and CLPSO-FPN [38] could only detect fault "Winding insulation burnt". Although rMFRSNPs [40] could also detect faults "Winding insulation burnt" and "Bearing damage", fault "Broken rotor bar" that did not exist was also detected. In addition, the fault sources were slightly different for each method. Since FFPN and CLPSO-FPN could only detect fault event 36, their fault sources were only associated with event 36. Since rMFRSNPs detected one more fault, it found more fault sources than FRNSN P did. For the same case, it is reasonable and acceptable for different methods to have slightly different fault sources due to different operating mechanisms and parameter settings.

Conclusions
In this work, the NSN P systems were extended to the FRNSN P systems by introducing IVTFNs. FRNSN P systems can easily model the fuzzy production rules of motor faults. A fuzzy reasoning algorithm based on the FRNSN P system was proposed for motor fault diagnosis. Through the study of single fault and multiple fault cases, the effectiveness and feasibility of the FRNSN P reasoning algorithm were proved for motor fault diagnosis. In addition, the relative preference relationship can be used to estimate the severity of various faults, so that the motor can be repaired in time when a minor fault occurs to prevent the fault from worsening.
Since it is necessary to rely on historical data and expert experience to obtain the probability of occurrence of motor fault symptoms, signal processing technology will be combined with the FRNSN P system to obtain real-time motor fault information in a future study. Specifically, considering that the stator current signal is minimally affected by the external environment and the current sensor is easy to install, the current signal will be used to obtain fault information. According to the fault information, the occurrence probability of some cause events can be obtained early, the fault probability corresponding to the IVTFN can then be estimated, and the FRNSN P reasoning algorithm is finally used for fault diagnosis. Furthermore, other intelligent algorithms can be introduced into the FRNSN P system so as to apply it to other real-world applications including the fault diagnosis of other types of motors.