# A Hybrid Approach to Failure Analysis Using Stochastic Petri Nets and Ranking Generalized Fuzzy Numbers

Authors: Abolfazl Doostparast Torshizi; Jamshid Parvizian
Journal: Advances in Fuzzy Systems
 (2012)

---

## Abstract

We present a novel failure analysis approach combining structural properties of stochastic Petri Nets and flexibility of fuzzy logic. Firstly, we develop a powerful fuzzy ranking technique. We analyze major drawbacks of existing ranking techniques. Then we demonstrate the capabilities of the presented algorithm to overcome such drawbacks. The approach considers weight, spread, and difference ofx coordinate of the center of gravity (COG) point of each fuzzy number and is able to deal with a wide variety of fuzzy numbers. Using this technique, we utilize isomorphism between stochastic Petri Nets and their corresponding Markov chains and present a failure analysis algorithm incorporating some critical factors. This algorithm can be implemented in diverse industrial applications.


---

## Body

## 1. Introduction

Failure can be defined as any unwanted deviation from the desired predetermined plan, which may lead to any kind of human injuries or damages of machines. In order to perform corrective actions, prioritizing failures is necessary. One of the most popular risk analysis procedures aiming to prioritizing failure states is Failure Mode and Effect Analysis (FMEA) which is based on three factors of severity, detectability, and occurrence of failure. This method was introduced in 1960s. Its wide applications are documented by Braglia et al. [1] and Stamatis [2]. Process of calculating risk priority numbers in this method consists of multiplication of the three-mentioned risk factors. It is apparent that various combinations of risk factors may lead to a constant risk priority number. This is the most critical challenge FMEA faces. However, there are many other weaknesses in this method which makes it impractical in real world problems [3, 4].Up to now, many different approaches have been presented to overcome the limitations of FMEA. These methods rely on diverse techniques such as grey theory [4], Bayesian Nets [5], Monte Carlo simulation [6], Markov models [7], and fuzzy logic [8]. Among all these techniques, fuzzy logic has been extensively applied in risk analysis. Fuzzy logic is capable of handling vagueness of human suggestions; so that it is useful in prioritizing risky behaviors of the systems.Fuzzy risk analysis is a new field firstly introduced by Schmucker [9]. This method is similar to traditional FMEA; however, risk parameters are fuzzy numbers. Fuzzy arithmetic is used to obtain fuzzy risk priority numbers. This method is rather versatile although suffers from ignoring many critical risk parameters. Using fuzzy risk analysis and fuzzy arithmetic, many different researches have been performed so far. Among them, combination of fuzzy risk analysis and ranking methods are extensively studied. Based on Schmucker [9], a fuzzy risk analysis method using signal/noise ratio was presented by Chen and Wang [10], in which fuzzy risk priority numbers were ranked by this ratio. Different kinds of fuzzy numbers such as generalized ones and their application in safety analysis are investigated by S. M. Chen and J. H. Chen [11, 12]. Application of similarity measures between fuzzy numbers is investigated in [11–13]. The fuzzy risk analysis method proposed by Schmucker [9] is widely utilized in so many researches performed so far. Fuzzy risk analysis methods are based on either ranking techniques or similarity measures, with differences only in prioritization style. In ranking based methods fuzzy risk priority numbers (FRPN) are ranked by different ranking techniques; while in similarity based techniques, the same FRPN are ranked by measuring the similarity level between FRPN and some predetermined linguistic variables.Failure analysis techniques traditionally rely on static evaluation of systems, which fails in tracking risky behaviors. Hence, implementing dynamic tools to enable auditors to monitor systems dynamically seems beneficial. One of the most common tools in modeling dynamic systems are Petri Nets (PN) [21, 22]. PN are powerful modeling methods which can simulate behaviors of systems dynamically in such a way that different states of the system can be visualized. There are many different versions of Petri Nets including timed, stochastic, and colored. In stochastic Petri Nets firing of transitions depend on a stochastic variable with exponential distribution.In this paper, we introduce a novel failure analysis method in which the Petri Net model of the system is constructed. This model includes different potential risks. According to isomorphism between live bounded stochastic Petri Nets and Markov chains, fuzzy steady state probabilities are calculated in the form of generalized trapezoidal fuzzy numbers. In these fuzzy probabilities, the weight of each fuzzy number is a combination of several new risk factors. Finally, these fuzzy probabilities are ranked by a new powerful fuzzy ranking method.The rest of the paper is structured as follows. In Section2, the bases of Stochastic Petri Nets (SPN) are given. SPN with fuzzy parameters and their application in safety analysis of the systems are summarized in Section 3. In Section 4, a novel ranking method of generalized fuzzy numbers is presented and compared with other methods in the field. In Section 5, we deal with a risk prioritizing method using SPN and generalized fuzzy numbers which opens a new field in risk prioritizing techniques literature. In Section 6, an illustrative example is presented to clarify the methods proposed in the paper. The paper is concluded in Section 7.


## 2. Stochastic Petri Nets

SPN are a family member of Petri Nets in which firing rates are exponentially distributed. Before introducing SPN, we present the definition of Petri Nets introduced by Petri [23]. Petri Net (PN) Z
=
(
P
,
T
,
I
,
O
,
m
) is a five-tuple, where(1)
P
=
{
p
1
,
p
2
,
…
,
p
n
}
,
n
>
0 is a finite set of places pictured by circles,
(2)
T
=
{
t
1
,
t
2
,
…
,
t
s
}
,
s
>
0 is a finite set of transitions pictured by bars,
(3)
I
=
P
×
T
→
N is an input function that defines the set of directed arcs from P to T where N
=
{
0
,
1
,
2
,
…
},
(4)
O
=
T
×
P
→
N is an output function that defines the set of directed arcs from T to P,
(5)
m
:
P
→
N is a marking whose ith component represents the number of tokens in the ith place. An initial marking is denoted by m
0. The tokens are pictured by dots.PN are able to model systems dynamically. One of the crucial drawbacks in utilizing ordinary PN is their inability in handling some important factors such as time and vagueness. To solve such problems various kinds of nets such as timed, fuzzy, and stochastic PN have been developed.In SPN, the set of firing ratesΛ
=
(
λ
1
,
λ
2
,
…
,
λ
s
) are exponentially distributed, such that each transition can be fired only after an exponentially distributed time delay with parameter 1
/
λ elapses.An important aspect of stochastic PN is their isomorphism with Markov chains. It has been proved that live and bounded SPN are isomorphic to continuous-time Markov chains [24]. This important property makes SPN analysis straightforward. In SPN, each marking of the net is equivalent to the states of its corresponding Markov chain. Therefore, some important factors, like steady state probabilities, are easily computed. Here, we present the formal definition of SPN.A SPNZ
=
(
P
,
T
,
I
,
O
,
m
0
,
Λ
) is a six-tuple, where(1)
P
=
{
p
1
,
p
2
,
…
,
p
n
}
,
n
>
0 is a finite set of places,
(2)
T
=
{
t
1
,
t
2
,
…
,
t
s
}
,
s
>
0 is a finite set of transitions with P
∪
T
≠
∅, and P
∩
T
=
∅,
(3)
I
=
P
×
T
→
N is an input function that defines the set of directed arcs from P to T where N
=
{
0
,
1
,
2
,
…
},
(4)
O
=
T
×
P
→
N is an output function that defines the set of directed arcs from T to P,
(5)
m
:
P
→
N is a marking whose ith component represents the number of tokens in the ith place. An initial marking is denoted by m
0, and
(6)
Λ
:
T
→
R
+ is a firing function whose ith component represents the firing rate of the ith transition where λ
i denotes the firing rate of t
i and R
+ is the set of all possible real values.Firing rules in SPN are simply similar to ordinary PN with a difference only in firing times of transitions. In SPN, when a transition is enabled, all tokens in the upstream places remain in their places until the firing time of the corresponding transition elapses; then the tokens deposited in upward places are removed and added to all downward places of that transition.In order to construct the corresponding Markov chain of SPN, the reachability graph of the net must be constructed first. Then using (1), the steady state probabilities can be calculated,
(1)
Π
Q
=
0
,
∑
i
=
0
s
π
i
=
1
in which π
i is the probability of being in state M
i; and Π
=
(
π
1
,
π
2
,
…
,
π
s
). From steady state distribution Π, this is possible to predict the performance of the system. For more details the reader is referred to Bause and Kritzinger [25].


## 3. Stochastic Petri Nets with Fuzzy Parameters

Safety is the knowledge of utilizing recorded data to predict potential failure in future. In normal conditions, failures occur rarely. Thus, expertise in predicting the frequency of different failure states is necessary. Suggestions by experts are usually vague and do not include specific numerical values and are given often in linguistic variables. Classical mathematics faces difficulties in handling nondeterministic values. Fuzzy set theory is a powerful method for handling vague conditions.In this paper, according to vagueness of experts’ knowledge in predicting failure rates of different risky states, we propose a new approach to determine fuzzy steady state probabilities based on generalized fuzzy numbers.As explained earlier, SPN are isomorphic to continuous-time Markov chains; thus steady state probabilities can be computed by dominating rules on Markov chains. We consider the failure rates of each potential risk in the system as a fuzzy number. Let us introduce some notations used in the rest of the paper; for more information, see [26].Definition 1.
A fuzzy number is a convex normalized fuzzy setM
~ of the real line ℝ such that(1)
there exists exactly onex
0
∈
ℝ with μ
m
~
(
x
0
)
=
1 (x
0 is called the mean value of M
~);
(2)
μ
m
~
(
x
0
) is piecewise continuous.For the sake of computational efficiency, some special forms of fuzzy numbers with triangular or trapezoidal membership functions are used. Sometimes, a more general form of fuzzy numbers is needed. For instance, in this paper, generalized fuzzy numbers are used with the extra feature of weighted membership functions. Their generality is according to the weight of the mean value or the supremum of their membership function. In Figure1 a generalized trapezoidal fuzzy number is depicted.Figure 1
A generalized trapezoidal fuzzy number.Definition 2.
An alpha cut (α-cut) of a fuzzy number A
~, if it is a subset of the set Ω, is defined as:
(2)
A
~
(
α
)
=
{
x
∈
Ω
∣
A
~
(
α
)
≥
α
}
0
<
α
≤
1
.
On the other hand, each fuzzy number can be represented by its alpha cut. For example, in a fuzzy number Q
~ we have
(3)
Q
~
(
α
)
=
[
q
1
(
α
)
,
q
2
(
α
)
]
in which values of q
1
(
α
) and q
2
(
α
) are the lower and upper bounds of this alpha cut, respectively.
Fuzzy arithmetic offers two concepts:extension principle and operations between alpha cuts. In this paper, we rely on the second concept since it can be adapted by the extension principle; in addition, incorporating alpha cuts is easier.
Let us consider two fuzzy numbersA
~ and B
~ and their alpha cuts A
~
(
α
)
=
[
a
1
(
α
)
,
a
2
(
α
)
] and B
~
(
α
)
=
[
b
1
(
α
)
,
b
2
(
α
)
], respectively. Operations between fuzzy numbers in the framework of alpha cuts are
(4)
A
~
(
α
)
+
B
~
(
α
)
=
[
a
1
(
α
)
+
b
1
(
α
)
,
a
2
(
α
)
+
b
2
(
α
)
]
,
A
~
(
α
)
-
B
~
(
α
)
=
[
a
1
(
α
)
-
b
2
(
α
)
,
a
2
(
α
)
-
b
1
(
α
)
]
,
A
~
(
α
)
·
B
~
(
α
)
=
[
c
(
α
)
,
d
(
α
)
]
in which,
(5)
c
(
α
)
=
min
{
a
1
(
α
)
b
1
(
α
)
,
a
1
(
α
)
b
2
(
α
)
,
a
2
(
α
)
b
1
(
α
)
,
a
2
(
α
)
b
2
(
α
)
}
,
d
(
α
)
=
max
{
a
1
(
α
)
b
1
(
α
)
,
a
1
(
α
)
b
2
(
α
)
,
a
2
(
α
)
b
1
(
α
)
,
a
2
(
α
)
b
2
(
α
)
}
.
The dividing operation among fuzzy numbers is defined as
(6)
A
~
(
α
)
B
~
(
α
)
=
[
a
1
(
α
)
,
a
2
(
α
)
]
·
[
1
b
2
(
α
)
,
1
b
1
(
α
)
]
.


## 4. Ranking Method of GeneralizedFuzzy Numbers

Application of fuzzy sets theory in reliability and safety engineering has been an active field of research in recent years.  One of the most alluring fuzzy techniques is ranking of fuzzy numbers. Chen and Wang [10] proposed a fuzzy risk analysis method based on signal/noise ratio. For more details, reader is referred to [11–13].In this section, we propose a novel approach for ranking generalized trapezoidal fuzzy numbers. This approach will be used for risk analysis in the following sections. The algorithm is as follows.Step 1.
Consider the generalized fuzzy numberA
~
i
=
(
a
i
1
,
a
i
2
,
a
i
3
,
a
i
4
;
w
A
~
). Use (7) for standardizing the generalized fuzzy number
(7)
A
~
i
*
=
(
a
i
1
k
,
a
i
2
k
,
a
i
3
k
,
a
i
4
k
;
w
A
~
i
*
)
,
k
=
max
i
j
(
⌈
|
a
i
j
|
⌉
,
1
)
.Step 2.
Calculate the center of gravity point of the standard fuzzy number, (7),
(8)
y
A
~
i
*
=
{
(
(
a
i
3
-
a
i
2
)
/
(
a
i
4
-
a
i
1
)
+
2
)
w
A
~
i
*
6
a
i
1
≠
a
i
4
,
w
A
~
i
*
2
,
a
i
1
=
a
i
4
,
x
A
~
i
*
=
y
A
~
i
*
(
a
i
3
+
a
i
2
)
+
(
a
i
4
+
a
i
1
)
(
w
A
~
i
*
-
y
A
~
i
*
)
2
w
A
~
i
*
.Step 3.
Calculate the standard deviation of each standardized fuzzy number,(9)
STD
A
~
i
*
=
∑
j
=
1
4
(
a
i
j
*
-
x
A
~
i
*
)
2
4
-
1
.
It is apparent that the interval of the obtained standard deviation is [0, 1.1547]. Variation of a crisp value is zero and variation of the generalized fuzzy number (−1, −1, −1, −1:w) is 1.1547.Step 4.
Calculate the difference ofx coordinate of each fuzzy number from the least value,
(10)
α
=
x
*
-
x
min
*
x
max
*
-
x
min
*
if
x
min
*
≠
x
max
*
in which
(11)
x
max
*
=
Max
{
x
A
~
1
*
,
x
A
~
2
*
,
…
,
x
A
~
n
*
}
,
x
min
*
=
Min
{
x
A
~
1
*
,
x
A
~
2
*
,
…
,
x
A
~
n
*
}
,
α
=
0
if
x
min
*
=
x
max
*
≠
0
,
α
=
0.5
if
x
min
*
=
x
max
*
=
0
.Step 5.
Calculate the ranking value of each standard generalized trapezoidal fuzzy number,(12)
Rank
A
~
i
*
=
x
A
~
i
*
(
w
A
~
i
*
+
1
)
+
α
1
+
STD
A
~
i
*
.Notation 1.
The proposed ranking method concentrates on crisp value of the fuzzy number in contrast to its deviation.Example 3.
In order to demonstrate the capabilities of the method we have compared the ranking output with six other important and common ranking techniques. This comparison is performed for two groups of fuzzy numbers, Figures2 and 3.
The ranking is shown and compared for the first group in Table1. This is clear that S. M. Chen and J. H. Chen [11] method fails to rank the fuzzy numbers A
~ and B
~. This is the case whenever the deviations and (mean value × weight) are the same for fuzzy numbers, [27].
It is noteworthy to mention that in our proposed method, crisp value of the fuzzy number has priority over its deviation and spread. Therefore, the numberA
~ has priority over the other fuzzy numbers.
The second group, Figure3, consists of eight sets of fuzzy numbers with different shapes and deviations suitable to evaluate our ranking algorithm [12]. Table 2 gives the result of ranking for this group, ranked using the proposed method and seven different algorithms presented in the literature. The highlighted items indicate invalid ranking by different algorithms. Cheng’s method [14] and Chu’s method [15] cannot rank fuzzy numbers of the second and third sets. Murakami’s technique [16] gives the same result for the two members of set 3. Yager’s method [17], as one of the most common ranking techniques, gives the same result for set 2, set 3, and set 4. This shows that this algorithm is not capable of ranking fuzzy numbers in general. All these algorithms fail in ranking of fuzzy numbers in the set 5. S. J. Chen’s and S. M. Chen’s method [18] ranks the numbers correctly; however, the ranking scores are very close to each other. For sets 2 and 6, Lee and Chen’ method [19] ranks the fuzzy numbers in an incorrect order.
As noted before, the main focus of the method proposed in the current paper is on crisp values of fuzzy numbers; that is why S. M. Chen’s and J. H. Chen’s method [11] has a valid but different ranking result. The latter method puts priority on variation and spread of numbers instead of their crisp values.
According to the results presented in Table2, Figure 5 shows the percentage of correct answers of the compared methods. It can be seen that only the proposed method and the approach proposed by S. J. Chen and S. M. Chen [18] has successfully solved the entire fuzzy sets of Figure 3.Table 1
Comparison results of Figure2.
Ranking method
A
~
B
~
S. M. Chen and J. H. Chen [11]
0.1375
0.1375
The proposed method
1.68486
0.30964Table 2
Comparison results of Figure3.
Ranking method
Set 1
Set 2
Set 3
Set 4
Set 5
Set 6
Set 7
Set 8
A
~
B
~
A
~
B
~
A
~
B
~
A
~
B
~
A
~
B
~
A
~
B
~
A
~
B
~
A
~
B
~
C
~
Cheng's method  [14]
0.5831
0.7071
0.5831
0.5831
0.5831
0.5831
0.461
0.5831
0.4243
*
0.5831
0.5831
0.7673
0.7241
0.68
0.7275
0.7462
Chu and Tsao’s method [15]
0.15
0.25
0.15
0.15
0.15
0.15
0.12
0.15
0.15
*
−0.15
0.15
0.287
0.2619
0.2281
0.2624
0.2784
Murakami et al.’s method  [16]
0.3
0.5
0.3
0.4176
0.3
0.3
0.2333
0.3
0.4167
*
−0.3
0.3
0.6
0.5
0.44
0.5333
0.525
Yager's method  [17]
0.3
0.5
0.3
0.3
0.3
0.3
0.3
0.3
0.3
*
−0.3
0.3
0.6
0.5
0.44
0.5333
0.525
S. J. Chen and S. M. Chen's method [18]
0.4456
0.4884
0.4239
0.4456
0.4456
0.4728
0.3565
0.4456
0.424
0.86
0.4456
0.7473
0.4128
0.4005
0.3719
0.4155
0.3979
S. M. Chen and J. H. Chen’s method  [11]
0.2579
0.4298
0.2537
0.2579
0.2579
0.2774
0.2063
0.2579
0.2537
1
−0.258
0.2579
0.4428
0.4043
0.3354
0.4079
0.4196
Lee and Chen's method  [19]
0.60976
0.70223
0.61531
0.60976
0.6098
0.6299
0.5098
0.6097
0.6153
0.88
0.5244
0.5223
0.7152
0.6968
0.6507
0.6896
0.6695
The proposed method
0.51578
1.71925
0.50737
0.51577
0.5158
0.5547
0.46419
0.5157
0.5073
3
−0.5158
1.3754
1.6923
0.7692
0.6521
1.6053
1.462Figure 2
Group 1: Two generalized triangular fuzzy numbers. Both deviations and (mean value × weight) are the same for both numbers.Group 2: seven sets of fuzzy numbers used to test the ranking algorithm [12].Example 4.
One of the latest fuzzy risk analysis approaches, based on ranking fuzzy numbers, is presented in [20], in which the ranking technique is based on the areas between the left and the right parts of the membership function of each fuzzy number with 1 and −1 as possible infimum and supremum values of fuzzy numbers. However this approach is not able to deal with symmetric fuzzy numbers. In such cases, the result of ranking for each symmetric fuzzy number will be zero. For example, consider two symmetric generalized fuzzy numbers A
~
=
(
-
0.8
,
0
,
0
,
0.8
;
0.5
) and B
~
=
(
-
0.5
,
0
,
0
,
0.5
;
0.7
) as depicted in Figure 4. Table 3 compares the results using Chen and Sanguansat method [20] and the current algorithm. It is clear that the Chen and Sanguansat method [20] is not able to rank symmetric generalized fuzzy numbers.Table 3
Ranking of numbers given in Figure4.
Ranking method
A
~
B
~
Chen and Sanguansat [20]
0
0
Current paper
0.3024
0.3464Figure 4
Two symmetric fuzzy numbers.Figure 5
Percentage of correctness of the compared method according to Table2.


## 5. Risk Prioritizing

Modeling complex systems using ordinary Petri Nets is a daunting task, since implementation of some concepts such as time, possibility, and probability is not considered in the initial definition of ordinary PN. Generally, analysis of complex systems includes two kinds of uncertainties [18]: stochastic situations and fuzzy states. For stochastic situations the behavior of system parameters is described by probability distribution functions. In other words, this kind of uncertainty models randomness. On the other hand, uncertainty in fuzzy form models the level of measurement accuracy using linguistic structures and insufficient information. There are many inaccuracy sources in systems, such as inaccurate internal operations. In some cases, uncertainty is the result of both randomness and inaccuracy, simultaneously. In stochastic PN, where time is the only existing stochastic parameter, system delays can be described by probability functions. It is worth to note that during system analysis, existing uncertainties may be hidden in the final results. Therefore, utilizing fuzzy set theory is an important alternative to overcome this drawback.Although the dominant paradigm in describing uncertainties of models is stochastic modeling based upon probability, using such models is only appropriate for describing stochastic states among entire uncertain situations. This is more important when considering inaccuracy of some data which are not instinctively statistical [28].Here, a comprehensive approach to prioritize different risk states of the system is presented. In this approach, by utilizing probability determination via steady state probabilities of stochastic PN, fuzzy probabilities of occurrence of each failure are calculated. In our approach, parameters of the exponential distribution are deemed to be generalized fuzzy numbers. Eventually, values of the resulting fuzzy probabilities are ranked by the novel ranking method presented in Section3. In the following, we present the process of prioritization of failure modes. Our approach has three stages where each stage consists of several substages. This approach extends the method proposed in [29] to a risk analysis method.Stage 1.
(1) Modeling the desired system using Petri Nets and determining the entire failure modes and allocating exponential firing times to considered transitions.
(2) Constructing reachability graph of the net and determining all states.
(3) Incorporating (1) in order to calculate the steady state probabilities of the system parametrically based on exponential rates of system transitions.Stage 2.
(1) Conversion of parametric probabilities of (3) in Stage1 to triangular fuzzy numbers considering each parameter.
(2) Determination of fuzzy probabilities based on alpha cuts of each fuzzy number using (4) to (6).
(3) Calculation of each probabilistic value (π
i) and determination of maximum and minimum values of this probability (α
=
0). When α
=
0, each probability π
i must be in interval [
0
,
1
] to be feasible; thus next steps are proceeded if this condition does not hold.
(4) Operations among fuzzy numbers using alpha cuts depend on minimum and maximum operators. This will provide a larger interval during the calculation. Theoretically,α
=
0 cut of a fuzzy number gives the largest interval of the number. Since our aim is to find the fuzzy probability values, the largest possible value of fuzzy numbers must be constrained to [
0
,
1
]. Therefore, our aim is to find the shortest alpha:
(13)
Min
(
Z
)
=
α
St
.
π
i
+
(
α
)
≤
1
π
i
-
(
α
)
≥
0
π
i
-
(
α
)
≤
π
i
+
(
α
)
0
≤
α
≤
1
.Stage 3.
(1) Converting each resulting failure probability to a generalized fuzzy number. This conversion is performed by combining severity index of each failure mode with fuzzy probabilities calculated in Stage2. In this research, we have considered five critical factors to determine occurrence weight of each failure mode. These factors are maintenance costs, operational dependability, safety, failure detection methods, and repairing time.
In order to obtain these factors easily, we have provided some linguistic variables with their corresponding weights presented in Tables4, 5, 6, 7, and 8. Finally, these critical factors must be combined to get the severity factor of each failure mode. This process includes a multiplication of these variables as
(14)
S
j
=
S
j
1
×
S
j
2
×
S
j
3
×
S
j
4
×
S
j
5
in which S
i
j represents the value of ith factor from five critical factors influencing failure j and S
j represents the final severity measure of the failure j.
(2) Ranking each generalized fuzzy probability provided in (1) in Stage3 using the ranking technique proposed in Section 3.Table 4
Classification of safety severity of each failure mode.
State
S
j
1
Very dangerous, without warning and periodical inspection
1
Very dangerous, without periodical inspection
0.9
Very dangerous with automatic warning system
0.8
Dangerous, without warning and periodical inspection
0.7
Dangerous, with periodical inspection or warning system
0.6
Average danger, without warning system and periodical inspection
0.5
Average danger with warning system and periodical inspection
0.4
Low danger, without warning system or periodical inspection
0.3
Low danger, with warning system or periodical inspection
0.2
Without any important risk
0.1
No safety risk
0Table 5
Classification operational dependability between failure modes.
State
S
j
2
Very high, many numbers of machines malfunctioned
1
Very high, loss of quality in many of machines
0.9
High, an entire machine is off, a bottleneck is made for some sets of machines
0.8
High, an entire machine is off
0.7
Average to high, the initial performance of machine is lost but some tasks are possible to perform
0.6
Average, the initial performance of machine is lost but some tasks are possible to perform
0.5
Average, machine loses its functionality in some specific tasks
0.4
Low, quality decrease in secondary functions of machines
0.3
Low, machine loses a little part of its functionality
0.2
Very low
0.1
No dependability
0Table 6
Classification of detection and identification of failure modes.
State
S
j
3
Uncertainty
1
Very unlikely
0.9
unlikely
0.8
Very low
0.7
low
0.6
Average
0.5
Average to high
0.4
high
0.3
Very high
0.2
Nearly definite
0.1
Completely definite
0Table 7
Classification of repairing costs of failure modes.
State
S
j
4
Is not worth to fix
1
Hardly worth to fix
0.9
Extreme
0.8
High
0.7
Average high
0.6
Average
0.5
low
0.4
Average low
0.3
Low
0.2
Low importance
0.1
No cost
0Table 8
Classification of repairing time of a failure mode.
State
S
j
5
Very time consuming, no worth to fix
1
Long fixing time, hardly worth to fix
0.9
Very time consuming to fix
0.8
Long fixing time
0.7
Average to high fixing time
0.6
Average fixing time
0.5
Short fixing time
0.4
Fairly short fixing time
0.3
Very short fixing time
0.2
Fixing time not very important
0.1
Fixing time negligible
0


## 6. An Illustrative Example

In this section the approaches proposed in the paper are applied to a flexible manufacturing (FM) cell, adopted from [30]. This cell is of course adapted with the nature of failure analysis.The cell, Figure 6, has one incoming and one outgoing conveyor, one robotic arm, and one processing machine. Work-pieces enter the cell by an incoming conveyor and the robot (R) loads them to the machine (M). Since we want to consider different potential failure modes of the system, a breakdown loop is considered for the robot and processing machine which consists of a breakdown and a repair transition with their corresponding rates. When processing on M is over, it is unloaded by R and the work-piece will go to the outgoing conveyor. Now suppose that(1)
the processing machine can have failure modes. M takes two time units to breakdown and a quarter time unit to be repaired. Therefore, the average failure and repair rates are 0.5 and 4, respectively;
(2)
robot loading and taking work-piece rate is 45 per unit time. Also its unloading rate plus average rate of M processing is 8 per unit time. Robot is not failure free; hence, breakdown and repair rates, for the robot, are 0.4 and 5, respectively;
(3)
time delays considered in this example are entirely exponential.Figure 6
A flexible manufacturing cell.Figure 7
The Petri Net model of a flexible manufacturing cell.Now, the problem is to find fuzzy risk probabilities based on fuzzy steady state probabilities and risk parameters introduced earlier; then prioritizing them on the basis of the presented ranking technique. The Petri Net model of the system is live and bounded. Therefore, it is isomorphic with its corresponding Markov chain and the analysis can be performed by analysis of the Markov chain.In order to find fuzzy probabilities, we have to delineate the reachability and the Markov chain of the corresponding stochastic Petri Net of the FM cell.The description of places and transitions is represented in Tables9 and 10, respectively. Transitions firing rates are displayed in Table 11.Table 9
Description of Places of Figure7.
Place
Description
P
1
Work-piece ready
P
2
Robot in progress
P
3
Machine in process
P
4
Robot in repair
P
5
Machine in repair
P
6
Robot idle
P
7
Machine idleTable 10
Description of transitions in Figure7.
Transition
Description
T
1
Robot taking part
T
2
Machine is processing
T
3
Processing is finished and robot is unloading
T
4
Robot breakdown
T
5
Robot in repair
T
6
Machine breakdown
T
7
Machine in repairTable 11
Transition firing rates of Figure7.
Transition
Description
Rate
T
1
Taking part by R
45
T
2
R loading
45
T
3
M process finished and R is unloading
8
T
4
R breakdown
0.4
T
5
R repaired
5
T
6
M breakdown
0.5
T
7
M repaired
4In order to apply the proposed method, transition firing rate must be converted to fuzzy form and their corresponding alpha cuts must be obtained. The results of this transformation are shown in Table12.Table 12
Fuzzified transitions firing rates with their alpha cuts.
Fuzzified rates
Alpha-cut representation
λ
1
=
(
35,45,55
)
λ
1
=
(
35
+
10
α
;
55
-
10
α
)
λ
2
=
(
35,45,55
)
λ
2
=
(
35
+
10
α
;
55
-
10
α
)
λ
3
=
(
7,8
,
9
)
λ
3
=
(
7
+
α
;
9
-
α
)
λ
4
=
(
0.3,0.4,0.5
)
λ
4
=
(
0.3
+
0.1
α
;
0.5
-
0.1
α
)
λ
5
=
(
4,5
,
6
)
λ
5
=
(
4
+
α
;
6
-
α
)
λ
6
=
(
0.4,0.5,0.6
)
λ
6
=
(
0.4
+
0.1
α
;
0.6
-
0.1
α
)
λ
7
=
(
3,4
,
5
)
λ
6
=
(
3
+
α
;
5
-
α
)Based on Figure8, parametric steady state probabilities are calculated using (1),
(15)
(
π
0
,
π
1
,
π
2
,
π
3
,
π
4
)
×
[
-
λ
1
λ
1
0
0
0
0
-
λ
2
-
λ
4
λ
4
λ
2
0
0
λ
5
-
λ
5
0
0
λ
3
0
0
-
λ
3
-
λ
6
λ
6
0
0
0
λ
7
-
λ
7
]
=
0
,
π
0
+
π
1
+
π
2
+
π
3
+
π
4
=
1
.Figure 8
Markov chain and reachability graph of the modeled system.The resulting parametric steady state probabilities are(16)
Π
=
[
π
0
=
λ
2
λ
3
λ
5
λ
7
λ
π
1
=
λ
1
λ
3
λ
5
λ
7
λ
π
2
=
λ
1
λ
3
λ
4
λ
7
λ
π
3
=
λ
1
λ
2
λ
5
λ
7
λ
π
4
=
λ
1
λ
2
λ
5
λ
6
λ
]
,
whereλ
=
λ
2
λ
3
λ
5
λ
7
+
λ
1
λ
3
λ
5
λ
7
+
λ
1
λ
3
λ
4
λ
7
+
λ
1
λ
2
λ
5
λ
7
+
λ
1
λ
2
λ
5
λ
6. After obtaining parametric steady state probabilities, they have to be converted to their corresponding fuzzy form. By applying fuzzified transition firing rates in steady state probabilities, fuzzy steady state probabilities are calculated. Therefore, the alpha cut representations of fuzzy steady state probabilities are
(17)
π
0
=
[
10
α
4
+
175
α
3
+
1100
α
2
+
2975
α
+
2940
131
α
4
-
2964.5
α
3
+
25107
α
2
-
94312.5
α
+
132577.5
;
10
α
4
-
255
α
3
+
2390
α
2
-
9795
α
+
14850
131
α
4
+
1916.5
α
3
+
9464
α
2
+
25268.9
α
+
22760.5
]
,
π
1
=
[
10
α
4
+
175
α
3
+
1100
α
2
+
2975
α
+
2940
131
α
4
-
2964.5
α
3
+
25107
α
2
-
94312.5
α
+
132577.5
;
10
α
4
-
255
α
3
+
2390
α
2
-
9795
α
+
14850
131
α
4
+
1916.5
α
3
+
9464
α
2
+
25268.9
α
+
22760.5
]
,
π
2
=
[
α
4
+
16.5
α
3
+
96.5
α
2
+
241.5
α
+
220.5
131
α
4
-
2964.5
α
3
+
25107
α
2
-
94312.5
α
+
132577.5
;
α
4
+
24.5
α
3
+
219.5
α
2
-
857.5
α
+
1237.4
131
α
4
+
1916.5
α
3
+
9464
α
2
+
25268.9
α
+
22760.5
]
,
π
3
=
[
100
α
4
+
1400
α
3
+
7325
α
2
+
16975
α
+
14700
131
α
4
-
2964.5
α
3
+
25107
α
2
-
94312.5
α
+
132577.5
;
100
α
4
-
2200
α
3
+
18125
α
2
-
66275
α
+
90750
131
α
4
+
1916.5
α
3
+
9464
α
2
+
25268.9
α
+
22760.5
]
,
π
4
=
[
10
α
4
+
150
α
3
+
842.5
α
2
+
2102.4
α
+
1960
131
α
4
-
2964.5
α
3
+
25107
α
2
-
94312.5
α
+
132577.5
;
10
α
4
-
230
α
3
+
1982.5
α
2
-
7590
α
+
10890
131
α
4
+
1916.5
α
3
+
9464
α
2
+
25268.9
α
+
22760.5
]
.
Since the value of fuzzy probabilities must be in interval [
0
,
1
], we have to observe if they are out of this interval. Whenα
=
0 all the minimum and maximum bounds of each fuzzy number must be in [
0
,
1
]; however it is apparent that π
3
+
(
α
) exceeds 1. On the other hand, all π
i
-
(
α
) are positive. Therefore, the LP model of the problem, using (13), is given as:
(18)
Min
Z
=
α
121
α
4
+
2171.5
α
3
+
7074
α
2
+
35063.9
α
+
7910.5
≥
0
130
α
4
+
1941
α
3
+
9244.5
α
2
+
26126.4
α
+
21523
≥
0
31
α
4
+
4116.5
α
3
-
8661
α
2
+
91543.9
α
-
67990
≥
0
121
α
4
+
2146.5
α
3
+
7481.5
α
2
+
32858.9
α
+
11870.5
≥
0
0
≤
α
≤
1
.
Using LP software or spreadsheets like Excel, we can find the optimal value of α as 0.779. Thus the feasible fuzzy steady state probabilities will be as given in, Table 13.Table 13
Fuzzy steady state probabilities.
π
i
Fuzzy number
π
0
[
0.082,0.121,0.174
]
π
1
[
0.082,0.121,0.174
]
π
2
[
0.0065,0.0097,0.0141
]
π
3
[
0.453,0.68,1
]
π
4
[
0.0573,0.085,0.124
]In the next stage, the obtained fuzzy probabilities must be converted to generalized fuzzy numbers. According to Figure8, we have two risky states in our model, m
2 and m
4, so we just deal with them. We call m
2 and m
4 as risky states s
1 and s
2, respectively. Based on our intuition, we consider risk factors for both s
1 and s
2, as in Table 14.Table 14
The considered risk factors fors
1 and s
2.
S
i
j
Risk value
S
11
0.6
S
12
0.8
S
13
0.2
S
14
0.8
S
15
0.7
S
21
0.8
S
22
0.8
S
23
0.2
S
24
0.7
S
25
0.7The weights of both risky states are(19)
S
1
=
0.6
×
0.8
×
0.2
×
0.8
×
0.7
=
0.05376
,
S
2
=
0.8
×
0.8
×
0.2
×
0.7
×
0.7
=
0.06272
.Finally, the resulting generalized fuzzy probability numbers are (Figures9–10):
(20)
π
2
=
(
0.0065
,
0.0097
,
0.0097
,
0.0144
;
0.05376
)
,
π
4
=
(
0.0573
,
0.085
,
0.085
,
0.0124
;
0.06272
)
.Figure 9
Fuzzy probability numberπ
4.Figure 10
Fuzzy probability numberπ
2.Now, we incorporate the proposed ranking method and rank these two fuzzy probability numbers. Their ranking score for the failure modes are (R
(
π
2
)
=
0.010713), R
(
π
4
)
=
1.0185). Hence, s
2 has priority to perform corrective actions over s
1 because its fuzzy risk probability has a higher ranking score according to the ranking algorithm introduced in Section 4.


## 7. Conclusions

In this study we proposed a hybrid approach utilizing isomorphism between stochastic Petri Nets and Markov chains, and also a novel fuzzy ranking method. This approach is general and many different risk factors in the systems, which should be considered, are studied, for the first time. Another contribution of this paper is the application of fuzzy logic in determining steady state probabilities of systems and incorporating them in risk analysis.The proposed methodology can be useful in most real life applications such as industrial systems; however, an important issue regarding this methodology is complexity. Although this method is quite efficient in dealing with small or medium sized Petri Nets but it would be hard to implement it on more complex nets. Therefore, presenting new approaches to improve efficiency of the prosed method in order to handle large scale problems can be an appropriate topic for future studies.



---

*Source: 957697-2012-10-18.xml*