Ranganathan Sakthivel
| Gundala Vijayalakshmi*
© 2023 IIETA. This article is published by IIETA and is licensed under the CC BY 4.0 license (http://creativecommons.org/licenses/by/4.0/).
OPEN ACCESS
This paper aims to determine the reliability of a complex system using a Bayesian network. A Bayesian network (BN) is a probabilistic graphical model that represents knowledge about an uncertain domain where each component corresponds to a random variable and each edge represents the corresponding conditional probability. Bayesian network is used to estimate the multistate consecutive k-out-of-n: F system reliability. This paper presents the Bayesian network construction and the reliability of the proposed system. The reliability of linear and circular multistate consecutive k-out-of-n: F systems based on the Bayesian network are compared. Furthermore, the reliability of proposed system is shown to be significantly greater than the exact reliability obtained by Amirian, Khodadadi, and Chatrabgoun.
system reliability, Bayesian network, multistate system, consecutive k-out-of-n: F system, linear and circular system, conditional probability
Both the system and its components are permitted to take one of two states in classic reliability theory: functioning or failed. In a multistate system, the system and its components might be in more than one state, such as fully functional, partially functional, or entirely failed. The modelling of equipment situations is more flexible using a multi-state system reliability model.
The concept of the successive k-out-of-n: F system was first proposed by Chiang and Niu [1] and has been greatly considered in the idea of reliability. If a system with n components fails whenever k successive components fail, it is called a successive k-out-of-n: F system. The system is linear if the n components are arranged in a line. The system is circular if the n components are arranged in a circle.
The essential ideas of multistate system dependability were largely defined in these studies. The multistate system (MSS) qualities were first explored when the system structure function, minimal cut set and minimal path set, coherency, and element relevance were specified. Ross [2] developed and proved the analogue of the closure theorem for a rising failure rate average stochastic process, and later did the same for new better than used stochastic processes. The idea of binary coherent systems, proposed by Barlow and Wu [3], has been expanded for multistate components. With the binary structure and reliability function principles, many of the conclusions for the binary case can be obtained for multistate systems. El-Neveihi et al. [4] introduced the first MSS reliability optimization issue, which included distributing multistate elements into k-series systems with the goal of increasing the predicted number of systems operating at that level or above. The reliability evaluation of monotone multistate systems with s-independent multistate components, Aven [5] presented two efficient methods employing minimum pathways and minimal cuts. Levitin [6] utilized the universal generating function approach to determine that the dependability of multistate systems had two failure mechanisms.
Zaitseva et al. [7] and Zaitseva and Levashenko [8] used the theory of multi-valued logic to analyse the reliability of multistate parallel systems, series systems, series-parallel systems, and k/n systems, as well as the consequence of component state variations on system reliability, in order to avoid the tedious calculation of minimal path set and cut set. Hudson and Kapur [9, 10] discuss simulations and their uses in reliability investigation for scenarios where the structure can have a wide range of states and all of its modules can have a wide range of many states. They also discuss inclusion-exclusion constraints and how they compare to disjoint subset bounds. The later bounds are based on Abraham's recursive disjoint products, which have been generalized. Since 1996, Lisnianski and Levitin [11] have used the universal generating function approach and genetic algorithm to solve the redundancy optimization problem of a series-parallel power system and a bridge structure. For computing the dependability of a multistate system, Hwang and Yao [12] presented an O (Kn) approach, where K (K<n) is the maximum number of states for a component. Aggarwal et al. [13] developed utilizing minimal path vectors an effective heuristic solution to addressing the restricted redundancy optimization issue in multistate systems. Zhai and Lin [14] discussed how to set up and build a Bayesian network-based multi-state system model, as well as how to use prior and posterior likelihood to perform bidirectional implication investigation and directly estimate the system's dependability measures using prior probability and Conditional Probability Tables (
Langseth and Portinale [15] emphasized the characteristics of the modelling framework that make BNs particularly suitable for reliability applications, as well as on-going research important to reliability practitioners. Wilson and Huzurbazar [16] discussed how to conduct joint inference about all of the nodes in a network using multilevel discrete data. When system architectures are too complicated to be represented using fault trees, several approaches can be used. According to Khakzad et al. [17], BN is a superior safety analysis model because of its flexible structure, which allows it to match a wide range of accident situations. The dependability of subsea Blowout Preventer control systems is assessed at any given moment using Cai et al. [18] suggested Bayesian network models, and the difference between posterior and prior probability of any single component given system failure is calculated. Martins and Maturana [19] present a BN-based technique for assessing human dependability and applies it to the operation of an oil tanker, with an emphasis on collision risk. The model was used to estimate the most likely sequence of hazardous occurrences and therefore isolate essential activities in the ship's operation in order to investigate Internal Factors, Organizational Factors, Management and Skills that should be given greater attention in order to reduce risk.
Mi et al. [20] research centered on the dependability of complex multistate systems with epistemic uncertainty and common cause failures. The Dempster Shafer (DS) evidence theory is utilized to describe epistemic uncertainty in system through the state space reconstruction of
Madhumitha and Vijayalakshmi [25] calculated the mean time to failure and confidence interval using Bayesian methods for the Cons.k/n:F systems. Bibartiu et al. [26] defined the memory growth for the k/n voting gate was lowered from exponential to polynomial in the range of input events due to a scalable Bayesian network model. Nashwan [27] provided formula to calculate the precise reliability and failure likelihood functions for the linear and circular r-gap successive k-out-of-m-from-n: F systems. Amirian and Khodadadi [28] developed a new algorithm, that can determine the exact reliability for a large class of sequential linear and circular systems. Jegatheesan and Gundala [29] produced an evaluation of the linear (circular) Cons.k/n:F system’s fuzzy Bayesian reliability using the squared error loss function. Yin et al. [30] proposed a method for describing F systems with common components that combines the theoretical study of linear and circular k-out-of-n with the finite Markov chain imbedding approach. In addition, there are MATLAB programs that provide accurate reliability for sequential linear and circular systems. Our contribution is obtaining the Bayesian network reliability estimate of the multistate consecutive k-out-of-n: F system and comparing it with the exact reliability given by Amirian, Khodadadi, and Chatrabgoun.
In this paper, the reliability of the proposed system is derived by the Bayesian network. The remaining paper is organized as follows: Section 2 gives the background details and the brief introduction of multistate system and Bayesian network is explained in section 3. In section 4 the system reliability evaluation using BN is given. Section 5 gives the results and comparison and section 6 concludes the paper.
2.1 Multistate system
In a particular context, all systems are designed to perform their intended functions. Some systems are capable of doing tasks at varied levels of efficiency, which are referred to as performance rates. A MSS is a system with a finite number of possible performance rates. A MSS is usually made up of components that can be multistate itself. In fact, the simplest example of an MSS with two unique states is a binary system (perfect functioning and complete failure).
A MSS is any system made up of various binary state units that have a cumulative influence on the overall system performance. Indeed, the availability of a system's units determines its performance rate, since various numbers of accessible units might give different levels of task performance. The well-known k-out-of-n systems are a basic illustration of such a situation. These systems are made up of n identical binary units, and depending on the number of units available, they can have an n+1 state. The performance rate of the system is expected to be proportional to the number of units available. Performance rates corresponding to greater than k-1 available units are assumed to be acceptable. Because different combinations of k available units might give different performance rates for the entire system when their contributions to the cumulative system performance rate differ, the number of potential MSS states increases significantly.
In general, every element's performance rate can range from flawless to utter failure. Partial failures are failures that result in a reduction in element performance. Elements continue to operate at decreased performance rates after partial failure, and after complete failure, they are completely incapable of performing their functions. Consider a transmission station-based wireless communication system. The number of consecutive stations covered in a station's range determines its status. This quantity is dependent not only on the availability of station amplifiers, but also on signal propagation circumstances, which are affected by weather, solar activity, and other factors.
2.2 Multi state Bayesian network
A Bayesian network is a directed acyclic graph that consists of variables and directed edges that are all connected by a table of conditional probabilities for each variable on all of its parents. As a result, it’s a graphical depiction of unknown quantities that shows the model’s information flow as well as the probabilistic causal dependency between variables. Professor Pearl of the University of California proposed the BN in 1986, which is a directed acyclic graph (DAG) with nodes and directed acyclic arcs. Nodes represent components, while arcs connecting pairs of nodes reflect the connections between the components. Root nodes are nodes that have no parents and have prior probability. Conditional probability tables (CPTs) are present in all other nodes, with leaf nodes being those without descendants. A node's conditional probability table provides the likelihood of each state of the node based on all possible combinations of its parents' states.
The BN is built on the well-known Baye’s Rule. Assume that M and N are random components. The conditional probability of M given N can be written as:
$P(M / N)=\frac{P(M) P(N / M)}{P(N)}$ (1)
Here P(M) is prior likelihood, P(M|N) is posterior likelihood, and P(N|M) is likelihood ratio.
$\mathrm{P}(\mathrm{N})=\sum_{i=1}^l P\left(N / M=a_i\right) P\left(M=a_i\right)$ (2)
Suppose a Bayesian network possesses numerous components which are stated as U={X1,X2,… Xn}, Xi (i=1,2,….,n) is a failure occurrence of a specific component or system that has to be investigated. The conditioned independency theory is an important concept for simplifying the joint probability distribution. Assume that Par(Xi) is Xi’s the parent set and Nd(Xi) is Xi’s non-descendant set. Xiis independent of Nd(Xi) when conditioned on Par(Xi).
Therefore,
$P\left(X_i / P \operatorname{Par}\left(X_i\right), N d\left(X_i\right)\right)=P\left(X_i / P \operatorname{ar}\left(X_i\right)\right)$ (3)
The joint probability distribution may be calculated using the conditioned independency assumption as follows:
$\mathrm{P}(\mathrm{U})=P\left(X_1, X_2, \ldots X_n\right)=\prod_{i=1}^n P\left(X_i / \operatorname{Par}\left(X_i\right)\right)$ (4)
Xi 's probability distribution may be estimated as follows:
$P\left(X_i\right)=\sum_{\text {except } x_i} P(U)$ (5)
The posterior probability distribution of nodes may be determined given the evidence E.”
$P(U / E)=\frac{P(U, E)}{P(E)}=\frac{P(U, E)}{\sum_U P(U, E)}$ (6)
3.1 Linear multistate consecutive k-out-of-n: F system
All the basic components (nodes) N1,N2,… Nn are placed in linear arrangement, and all components have multiple states i.e., more than two states. The purpose of intermediate components M1,M2,...,Mn-k+1 is to find system reliability (SR) component. In the beginning LMC (k\n:F) system will function normally but it will fail only when consecutive k components fail. The intermediate component M1 connects the first k parent components with temporal link in the linear arrangement, and this will fail after all k parent components have failed. Similarly, k consecutive parent components are connected with temporal link to corresponding intermediate components M2,M3,...,Mn-k+1 respectively. All the intermediate components depend on the respective parent component. This arrangement of components is shown in Figure 1. If any one of the intermediate components fail, then LMC (k\n:F) system will fail.
Assumption of System reliability functions are as follows:
Figure 1. BN for linear multistate consecutive k-out-of-n: F system
LMC(k\n:F) system reliability calculation are given below.
Joint Probability function is:
$P(Z)=P\left(N_1, \ldots N_n, M_1, \ldots M_{n-k+1}, S R\right)=P(S R / \operatorname{Par}(S R)) \prod_{i=1}^{n-k+1} P\left(M_i / \operatorname{Par}\left(M_i\right)\right) \prod_{i=1}^n P\left(N_i\right)$ (7)
$\begin{gathered}P(Z)=P\left(S R / M_1, \ldots, M_{n-k+1}\right) \\ P\left(M_1 / N_1, \ldots N_k\right) \\ P\left(M_2 / N_2, \ldots, N_{k+1}\right) \ldots \ldots \\ P\left(M_{n-K-1} / N_{n-k}, \ldots, N_{n-1}\right) P\left(M_{n-k+1} / N_{n-k}, \ldots, N_n\right) \\ P\left(N_1\right) P\left(N_2\right) \ldots \ldots P\left(N_n\right)\end{gathered}$ (8)
Marginal Probability function is:
$P(S R)=\sum_{N_1=F S, \ldots N_n=F S, M_1=F S, \ldots M_{n-k+1}=F S}^{W S} \quad\,\,\,\, P(S R / \operatorname{Par}(S R)) \prod_{i=1}^{n-k+1} P\left(M_i / \operatorname{Par}\left(M_i\right)\right) \prod_{i=1}^n P\left(N_i\right)$ (9)
$P(S R)=\sum_{N_1=F S, \ldots N_n=F S, M_1=F S, \ldots M_{n-k+1}=F S}^{W S} \quad P\left(S R / M_1, \ldots, M_{n-k+1}\right) P\left(M_1 / N_1, \ldots, N_k\right) P\left(M_2 / N_2, \ldots, N_{k+1}\right)$
$\ldots \ldots P\left(M_{n-K-1} / N_{n-k}, \ldots, N_{n-1}\right) P\left(M_{n-k+1} / N_{n-k}, \ldots, N_n P\left(N_2\right) \ldots \ldots P\left(N_n\right)\right)$ (10)
Reliability for Final node (SR) is:
$\begin{aligned} & R(S R)=P\left(S R / M_1=F S, M_2=W S, \ldots, M_{n-k+1}=W S\right) P\left(M_1=F S\right) P\left(M_2=W S\right) \ldots \ldots P\left(M_{n-k+1}=W S\right)+P\left(S R / M_1=W S, M_2=F S, \ldots, M_{n-k+1}=\right. \\ & W S) P\left(M_1=W S\right) P\left(M_2=F S\right) \ldots \ldots P\left(M_{n-k+1}=W S\right)+ \\ & \vdots \\ & P\left(S R / M_1=F S, M_2=F S, M_3=W S, \ldots, M_{n-k+1}=W S\right) P\left(M_1=F S\right) P\left(M_2=F S\right) P\left(M_3=W S\right) \ldots \ldots P\left(M_{n-k+1}=W S\right)+ \\ & \vdots \\ & P\left(S R / M_1=F S, M_2=F S, M_3=F S, \ldots, M_{n-k+1}=W S\right) P\left(M_1=F S\right) P\left(M_2=F S\right) P\left(M_3=F S\right) \ldots \ldots P\left(M_{n-k+1}=W S\right)+ \\ & \vdots \\ & P\left(S R / M_1=F S, M_2=F S, M_3=F S, \ldots, M_{n-k+1}=F S\right) P\left(M_1=F S\right) P\left(M_2=F S\right) P\left(M_3=F S\right) \ldots \ldots P\left(M_{n-k+1}=F S\right)+ \\ & \vdots \\ & \quad R(S R)=P\left(S R / M_1=W S, M_2=W S, M_3=W S, \ldots, M_{n-k+1}=W S\right) P\left(M_1=W S\right) P\left(M_2=W S\right) P\left(M_3=W S\right) \ldots \ldots P\left(M_{n-k+1}=W S\right)\end{aligned}$ (11)
Probability Calculation for Intermediate nodes,
$\begin{aligned}& P\left(M_1=W S\right)=P\left(M_1=W S / N_1=W S, N_2=W S, N_3=W S, \ldots, N_k=W S\right) P\left(N_1=W S\right) P\left(N_2=W S\right) P\left(N_3=W S\right) \ldots \ldots \\& \left(N_k=W S\right)+P\left(M_1=W S / N_1=P W S, N_2=W S, \ldots, N_k=W S\right) P\left(N_1=P W S\right) P\left(N_2=W S\right) \ldots \ldots P\left(N_k=\right. \\& W S)+P\left(M_1=W S / N_1=F S, N_2=W S, \ldots, N_k=W S\right) P\left(N_1=F S\right) P\left(N_2=W S\right) \ldots \ldots \\& P\left(N_k=W S\right)+P\left(M_1=W S / N_1=W S, N_2=P W S, \ldots, N_k=W S\right) P\left(N_1=W S\right) P\left(N_2=P W S\right) \ldots \ldots P\left(N_k=W S\right)+ \\& P\left(M_1=W S / N_1=W S, N_2=F S, \ldots, N_k=W S\right) P\left(N_1=W S\right) P\left(N_2=F S\right) \ldots \ldots P\left(N_k=W S\right)+ \\& \vdots \\& P\left(M_1=W S / N_1=P W S, N_2=P W S, N_3=W S, \ldots, N_k=W S\right) \\& P\left(N_1=W S\right) P\left(N_2=P W S\right) P\left(N_3=W S\right) \ldots \ldots P\left(N_k=W S\right)+ \\& \vdots \\& P\left(M_1=W S / N_1=F S, N_2=F S, N_3=W S, \ldots, N_k=W S\right) P\left(N_1=F S\right) P\left(N_2=F S\right) P\left(N_3=W S\right) \ldots \ldots P\left(N_k=W S\right)+ \\& \vdots \\& P\left(M_1=W S / N_1=P W S, N_2=P W S, N_3=P F, \ldots, N_k=W S\right) \\& P\left(N_1=P W S\right) P\left(N_2=P W S\right) P\left(N_3=P W S\right) \ldots \ldots P\left(N_k=W S\right)+ \\& \vdots \\& P\left(M_1=W S / N_1=F S, N_2=F S, N_3=F S, \ldots, N_k=W S\right) \\& P\left(N_1=F S\right) P\left(N_2=F S\right) P\left(N_3=F S\right) \ldots \ldots P\left(N_k=W S\right)+ \\& \vdots \\& P\left(M_1=W S / N_1=F S, N_2=F S, \ldots, N_{k-1}=F S, N_k=W S\right) \\& P\left(N_1=F S\right) P\left(N_2=F S\right) P\left(N_3=F S\right) \ldots \ldots P\left(N_{k-1}=F S\right) P\left(N_k=W S\right)\end{aligned}$ (12)
$\begin{gathered}P\left(M_1=F S\right)=P\left(M_1=F S / N_1=F S, \ldots, N_{k-1}=F S, N_k=F S\right) \\ P\left(N_1=F S\right) \ldots \ldots P\left(N_{k-1}=F S\right) P\left(N_k=F S\right)\end{gathered}$ (13)
$\begin{aligned} & P\left(M_{n-k+1}=W S\right)=P\left(M_{n-k+1}=W S / N_{n-k}=W S, \ldots, N_n=W S\right) \\ & P\left(N_{n-k}=W S\right) \ldots \ldots P\left(N_n=W S\right)+ \\ & P\left(M_{n-k+1}=W S / N_{n-k}=P W S, N_{n-k+1}=W S, \ldots, N_n=W S\right) \\ & P\left(N_{n-k}=P W S\right) P\left(N_{n-k+1}=W S\right) \ldots \ldots P\left(N_n=W S\right)+ \\ & P\left(M_{n-k+1}=W S / N_{n-k}=F S, N_{n-k+1}=W S, \ldots, N_n=W S\right) \\ & P\left(N_{n-k}=F S\right) P\left(N_{n-k+1}=W S\right) \ldots \ldots P\left(N_n=W S\right)+ \\ & P\left(M_{n-k+1}=W S / N_{n-k}=W S, N_{n-k+1}=P W S, \ldots, N_n=W S\right) \\ & P\left(N_{n-k}=W S\right) P\left(N_{n-k+1}=P W S\right) \ldots \ldots P\left(N_n=W S\right)+ \\ & P\left(M_{n-k+1}=W S / N_{n-k}=W S, N_{n-k+1}=F S, \ldots, N_n=W S\right) \\ & P\left(N_{n-k}=W S\right) P\left(N_{n-k+1}=F S\right) \ldots \ldots P\left(N_n=W S\right)+ \\ & \vdots \\ & P\left(M_{n-k+1}=W S / N_{n-k}=F S, N_{n-k+1}=P W S, \ldots, N_n=W S\right) \\ & P\left(N_{n-k}=F S\right) P\left(N_{n-k+1}=P W S\right) \ldots \ldots P\left(N_n=W S\right)+ \\ & \vdots \\ & P\left(M_{n-k+1}=W S / N_{n-k}=F S, \ldots, N_{n-1}=F S, N_n=W S\right) \\ & P\left(N_{n-k}=F S\right) P\left(N_{n-k+1}=F S\right) \ldots \ldots P\left(N_{n-1}=F S\right) P\left(N_n=W S\right)\end{aligned}$ (14)
$\begin{aligned} & P\left(M_{n-k+1}=F S\right) \\ & P\left(M_{n-k+1}=F S / N_{n-k}=F S, \ldots, N_{n-1}=F S, N_n=F S\right) \\ & P\left(N_{n-k}=F S\right) P\left(N_{n-k+1}=F S\right) \ldots \ldots P\left(N_{n-1}=F S\right) P\left(N_n=F S\right)\end{aligned}$ (15)
Failure of system reliability (SR) is:
$R(S R=F S)=\sum_{\substack{\text { No. of failure } \\ \text { components in } \operatorname{Par}(S R) \geq 1}} P(S R=F S / \operatorname{Par}(S R)) P(\operatorname{Par}(S R))$ (16)
where,
$\begin{gathered}\operatorname{Par}(S R)=M_1, M_2, M_3 \ldots, M_{n-k+1} \\ P\left(M_i=F S\right)=P\left(M_i=F S / \operatorname{Par}\left(M_i=F S\right)\right) P\left(\operatorname{Par}\left(M_i=F S\right)\right) \\ \operatorname{Par}\left(M_i\right)=\text { Consecutive } k \text { components from } \\ N_1, N_2, N_3 \ldots, N_n\left(\text { Start with } i^{\text {th }} \text { component }, i=1,2,3, \ldots, n\right)\end{gathered}$
3.2 Circular multistate consecutive k-out-of-n: F system
All the basic components (nodes) N1,N2,… Nn are placed in circular arrangement, and all components have multiple states i.e., more than two states. The purpose of intermediate components M1,M2, …,Mn is to find system reliability (SR) component. In the beginning CMC(k\n:F) system will function normally but it will fail only when consecutive k components fail. The intermediate component M1 connects the first k parent components with temporal link in the linear arrangement, and this will fail after all k parent components have failed. Similarly, k consecutive parent components are connected with temporal link to corresponding intermediate components M2,M3,...,Mn-k+1 respectively. All the intermediate components depend on the respective parent component. This arrangement of components is shown in Figure 2. If any one of the intermediate components fail, then CMC(k\n:F) system will fail.
Assumption of System reliability functions are as follows:
CMC (k\n:F) system reliability calculation are given below,
Figure 2. BN for circular multistate consecutive k-out-of-n: F system
Joint Probability function is:
$\begin{gathered}P(Z)=P\left(N_1, \ldots N_n, M_1, \ldots M_n, S R\right)= P(S R / \operatorname{Par}(S R)) \prod_{i=1}^n P\left(M_i / \operatorname{Par}\left(M_i\right)\right) \prod_{i=1}^n P\left(N_i\right)\end{gathered}$ (17)
$\begin{gathered}P(Z)=P\left(S R / M_1, \ldots, M_{n-k+1}\right) P\left(M_1 / N_1, \ldots N_k\right) \\ P\left(M_2 / N_2, \ldots, N_{k+1}\right) \ldots \ldots P\left(M_{n-k} / N_{n-k}, \ldots, N_n\right) \\ P\left(M_n / N_n, N_1 \ldots, N_{k-1}\right) P\left(N_n\right) P\left(N_1\right) \ldots \ldots P\left(N_{k-1}\right)\end{gathered}$ (18)
Marginal Probability function is:
$P(S R)=\sum_{N_1=F S, \ldots N_n=F S, M_1=F S, \ldots M_{n}=F S}^{W S} \quad \,\,\,\, P(S R / \operatorname{Par}(S R)) \prod_{i=1}^{n} P\left(M_i / \operatorname{Par}\left(M_i\right)\right) \prod_{i=1}^n P\left(N_i\right)$ (19)
$P(S R)=\sum_{N_1=F S, \ldots N_n=F S, M_1=F S, \ldots M_{n}=F S}^{W S} \quad P\left(S R / M_1, \ldots, M_{n-k+1}\right) P\left(M_1 / N_1, \ldots, N_k\right) P\left(M_2 / N_2, \ldots, N_{k+1}\right)$
$\ldots P\left(M_n / N_n, N_1 \ldots, N_{k-1}\right) P\left(N_1\right) \ldots \ldots P\left(N_{k-1}\right) P\left(N_n\right)$ (20)
Reliability for Final node (SR) is:
$\begin{aligned} & R(S R)=P\left(S R / M_1=F S, M_2=W S, \ldots, M_n=W S\right) \\ & P\left(M_1=F S\right) P\left(M_2=W S\right) \ldots \ldots\left(M_n=W S\right)+ \\ & P\left(S R / M_1=W S, M_2=F S, \ldots, M_n=W S\right) \\ & P\left(M_1=W S\right) P\left(M_2=F S\right) \ldots \ldots P\left(M_n=W S\right)+ \\ & \vdots \\ & P\left(S R / M_1=F S, M_2=F S, M_3=W S, \ldots, M_{n-k+1}=W S\right) \\ & P\left(M_1=F S\right) P\left(M_2=F S\right) P\left(M_3=W S\right) \ldots \ldots P\left(M_n=W S\right)+ \\ & \vdots \\ & P\left(S R / M_1=F S, M_2=F S, M_3=F S, \ldots, M_n=W S\right) \\ & P\left(M_1=F S\right) P\left(M_2=F S\right) P\left(M_3=F S\right) \ldots \ldots P\left(M_n=W S\right)+ \\ & \vdots \\ & P\left(S R / M_1=F S, M_2=F S, M_3=F S, \ldots, M_n=F S\right) \\ & P\left(M_1=F S\right) P\left(M_2=F S\right) P\left(M_3=F S\right) \ldots \ldots P\left(M_n=F S\right)+ \\ & \vdots \\ & R(S R)=P\left(S R=W S / M_1=W S, M_2=W S, M_3=W S, \ldots, M_n=W S\right) \\ & P\left(M_1=W S\right) P\left(M_2=W S\right) P\left(M_3=W S\right) \ldots \ldots P\left(M_n=W S\right)\end{aligned}$ (21)
Probability Calculation for Intermediate nodes:
$\begin{aligned} & P\left(M_1=W S\right)= \\ & P\left(M_1=W S / N_1=W S, N_2=W S, N_3=W S, \ldots, N_k=W S\right) \\ & P\left(N_1=W S\right) P\left(N_2=W S\right) P\left(N_3=W S\right) \ldots \ldots P\left(N_k=W S\right)+ \\ & P\left(M_1=W S / N_1=P W S, N_2=W S, \ldots, N_k=W S\right) \\ & P\left(N_1=P W S\right) P\left(N_2=W S\right) \ldots \ldots P\left(N_k=W S\right)+ \\ & P\left(M_1=W S / N_1=F S, N_2=W S, \ldots, N_k=W S\right) \\ & P\left(N_1=F S\right) P\left(N_2=W S\right) \ldots \ldots P\left(N_k=W S\right)+ \\ & P\left(M_1=W S / N_1=W S, N_2=P W S, \ldots, N_k=W S\right) \\ & P\left(N_1=W S\right) P\left(N_2=P W S\right) \ldots \ldots P\left(N_k=W S\right)+ \\ & P\left(M_1=W S / N_1=W S, N_2=F S, \ldots, N_k=W S\right) \\ & P\left(N_1=W S\right) P\left(N_2=F S\right) \ldots \ldots P\left(N_k=W S\right)+ \\ & \vdots \\ & P\left(M_1=W S / N_1=P W S, N_2=P W S, N_3=W S, \ldots, N_k=W S\right) \\ & P\left(N_1=P W S\right) P\left(N_2=P W S\right) P\left(N_3=W S\right) \ldots \ldots P\left(N_k=W S\right)+ \\ & \vdots \\ & P\left(M_1=W S / N_1=F S, N_2=F S, N_3=W S, \ldots, N_k=W S\right) \\ & P\left(N_1=F S\right) P\left(N_2=F S\right) P\left(N_3=W S\right) \ldots \ldots P\left(N_k=W S\right)+ \\ & \vdots \\ & P\left(M_1=W S / N_1=P W S, N_2=P W S, N_3=P W S, \ldots, N_k=W S\right) \\ & P\left(N_1=P W S\right) P\left(N_2=P W S\right) P\left(N_3=P W S\right) \ldots \ldots P\left(N_k=W S\right)+ \\ & \vdots \\ & P\left(M_1=W S / N_1=F S, N_2=F S, N_3=F S, \ldots, N_k=W S\right) \\ & P\left(N_1=F S\right) P\left(N_2=F S\right) P\left(N_3=F S\right) \ldots \ldots P\left(N_k=W S\right)+ \\ & \vdots \\ & P\left(M_1=W S / N_1=F S, N_2=F S, \ldots, N_{k-1}=F S, N_k=W S\right) \\ & P\left(N_1=F S\right) P\left(N_2=F S\right) \ldots \ldots P\left(N_{k-1}=F S\right) P\left(N_k=W S\right)\end{aligned}$ (22)
$\begin{aligned} & P\left(M_1=F S\right)=P\left(M_1=F S / N_1=F S, \ldots, N_{k-1}=F S, N_k=F S\right) \\ & P\left(N_1=F S\right) P\left(N_2=F S\right) \ldots P\left(N_{k-1}=F S\right) P\left(N_k=F S\right)\end{aligned}$ (23)
$\begin{aligned} & P\left(M_n=W S\right)=P\left(M_n=W S / N_n=W S, N_1=W S, \ldots, N_{k-1}=W S\right) \\ & P\left(N_n=W S\right) \ldots \ldots P\left(N_{k-1}=W S\right)+ \\ & P\left(M_n=W S / N_n=P W S, N_1=W S, \ldots, N_{k-1}=W S\right) \\ & P\left(N_n=P W S\right) P\left(N_1=W S\right) \ldots \ldots P\left(N_{k-1}=W S\right)+ \\ & P\left(M_n=W S / N_n=F S, N_1=W S, \ldots, N_{k-1}=W S\right) \\ & P\left(N_{n-k}=F S\right) P\left(N_{n-k+1}=W S\right) \ldots \ldots P\left(N_n=W S\right)+ \\ & P\left(M_n=W S / N_n=W S, N_1=P W S, \ldots, N_{k-1}=W S\right) \\ & P\left(N_n=W S\right) P\left(N_1=P W S\right) \ldots \ldots\left(N_{k-1}=W S\right)+ \\ & P\left(M_n=W S / N_n=W S, N_1=F S, \ldots, N_{k-1}=W S\right) \\ & P\left(N_n=W S\right) P\left(N_1=F S\right) \ldots \ldots P\left(N_{k-1}=W S\right)+ \\ & \vdots \\ & P\left(M_n=W S / N_n=P W S, N_1=P W S, \ldots, N_{k-1}=W S\right) \\ & P\left(N_n=P W S\right) P\left(N_1=P W S\right) \ldots \ldots P\left(N_{k-1}=W S\right)+ \\ & \vdots \\ & P\left(M_n=W S / N_n=F S, N_1=F S, \ldots, N_{k-1}=W S\right) \\ & P\left(N_n=F S\right) P\left(N_1=F S\right) \ldots \ldots P\left(N_{k-1}=W S\right)+ \\ & \vdots \\ & P\left(M_n=W S / N_n=F S, N_1=P W S, \ldots, N_{k-1}=W S\right) \\ & P\left(N_n=F S\right) P\left(N_1=P W S\right) \ldots \ldots P\left(N_{k-1}=W S\right)+ \\ & \vdots \\ & P\left(M_n=W S / N_n=F S, N_1=F S, \ldots, N_{k-2}=F S, N_{k-1}=W S\right) P\left(N_n=F S\right) P\left(N_1=F S\right) \ldots \ldots P\left(N_{k-2}=F S\right) P\left(N_{k-1}=W S\right)\end{aligned}$ (24)
$P\left(M_n=F S\right)=P\left(M_n=F S / N_n=F S, N_1=F S, \ldots, N_{k-2}=F S, N_{k-1}=F S\right) P\left(N_n=F S\right) P\left(N_1=F S\right) \ldots P\left(N_{k-2}=F S\right) P\left(N_{k-1}=F S\right)$ (25)
Failure of system reliability (SR) is:
$R(S R=F S)=\sum_{\begin{array}{c}\text { No.of failure } \\ \text { components in } \operatorname{Par}(S R) \geq 1\end{array}} P(S R=F S / \operatorname{Par}(S R)) P(\operatorname{Par}(S R))$ (26)
where,
$\begin{gathered}\operatorname{Par}(S R)=M_1, M_2, M_3 \ldots, M_n \\ P\left(M_i=F S\right)=P\left(M_i=F S / \operatorname{Par}\left(M_i=F S\right)\right) P\left(\operatorname{Par}\left(M_i=F S\right)\right) \\ \operatorname{Par}\left(M_i\right)=\text { Consecutive } k \text { components from } \\ N_1, N_2, N_3 \ldots, N_n\left(\text { Start with } i^{\text {th }} \text { component }, i=1,2,3, \ldots, n\right)\end{gathered}$
3.3 Particular cases
Case (i)
When k=1, the system behaves like a series system, if any one of system component fails the entire system fails. In other words, if all of the components are operational, the system will function; otherwise, it will fail. Each component has failure probability P(Xi), and then reliability formula is:
$R_s(S)=\prod_i^n P\left(X_i\right)$
Case (ii)
When k=n, the system requires all components to failure; so the system behaves like a parallel system. Each component has failure probability P(Xi), and then reliability formula is:
$R_P(S)=1-\prod_i^n\left(1-P\left(X_i\right)\right)$
The BN reliability graph of the linear consecutive k-out-of-7: F system and circular consecutive k-out-of-7:F systems are shown in Figure 3 and Figure 4 respectively for the values given in Tables 1 and 2. The BN reliability of the system has been plotted for various probability values. It is observed that when the failure probability of component increases, reliability of the system decreases in both linear and circular systems. Table 3 shows the comparison of reliability Amirian et al. (2019) and BN reliability for both linear and circular systems. Figure 5 shows that the reliability evaluation for the proposed system using BN is approximately 10% and 8% higher than the reliability (R) by Amirian, Khodadadi, and Chatrabgoun (2019). Since BN is a robust model giving accurate results. The reliability value for the various k values is shown in Table 4. Figure 6 reveals that the LMC(k\7:F) system structure has nearly 0.8% higher reliability in comparison to CMC(k\7:F) system structure. This is because circular system has more failures compared to linear system. The Figures 3-6 are drawn using MATLAB.
Table 1. BN reliability for linear consecutive k-out-of-7:F system
|
Q |
0.1 |
0.2 |
0.3 |
0.4 |
0.5 |
0.6 |
0.7 |
0.8 |
0.9 |
|
|
BN R |
k=3 |
0.995 |
0.966 |
0.898 |
0.785 |
0.633 |
0.457 |
0.281 |
0.131 |
0.033 |
|
k=4 |
0.999 |
0.995 |
0.975 |
0.928 |
0.844 |
0.715 |
0.544 |
0.345 |
0.147 |
|
|
k=5 |
0.999 |
0.998 |
0.994 |
0.977 |
0.938 |
0.86 |
0.731 |
0.541 |
0.291 |
|
Table 2. BN reliability for circular consecutive k-out-of-7:F system
|
Q |
0.1 |
0.2 |
0.3 |
0.4 |
0.5 |
0.6 |
0.7 |
0.8 |
0.9 |
|
|
BN R |
k=3 |
0.994 |
0.955 |
0.867 |
0.73 |
0.555 |
0.367 |
0.197 |
0.073 |
0.012 |
|
k=4 |
0.999 |
0.991 |
0.96 |
0.891 |
0.773 |
0.609 |
0.413 |
0.217 |
0.062 |
|
|
k=5 |
0.999 |
0.998 |
0.988 |
0.955 |
0.883 |
0.754 |
0.565 |
0.332 |
0.108 |
|
Table 3. Reliability versus BN Reliability for linear and circular at n=11 and k=2
|
P |
0.25 |
0.5 |
0.75 |
0.8 |
0.9 |
0.95 |
0.99 |
|
R |
0.00006 |
0.0166 |
0.29721 |
0.43621 |
0.77915 |
0.93128 |
0.99673 |
|
BN LR |
0.00026 |
0.0563 |
0.524 |
0.665 |
0.904 |
0.975 |
0.999 |
|
BN CR |
0.00011 |
0.0422 |
0.492 |
0.638 |
0.895 |
0.973 |
0.998 |
Table 4. Reliability of linear and circular system for various k values
|
k |
1 |
2 |
3 |
4 |
5 |
6 |
|
BN LR |
0.21 |
0.807 |
0.966 |
0.995 |
0.999 |
0.999 |
|
BN CR |
0.21 |
0.783 |
0.955 |
0.991 |
0.998 |
0.999 |
Figure 3. BN reliability for linear system
Figure 4. BN Reliability for circular system
Figure 5. Reliability versus BN Reliability for linear and circular
Figure 6. Reliability comparison for linear and circular system
We derived the reliability formula for the linear and circular multistate consecutive k-out-of-n: F system using Bayesian network. We derived particular cases series and parallel from the consecutive k-out-of-n: F using Bayesian network. The reliability of proposed system is shown to be 10% and 8% greater than the exact reliability obtained by Amirian, Khodadadi, and Chatrabgoun. LMC(k\n:F) system is shown to be 0.8% higher in comparison to the CMC(k\n:F) system. In future, the reliability analysis of LMC(k\n:F) and CMC(k\n:F) systems can be performed by constructing a continuous time Bayesian network and Dynamic Bayesian network. We can derive reliability formula for the linear and circular multistate consecutive k-out-of-n: F system using Bayesian network with non-identical components.
|
LMC(k\n:F) |
Linear Multistate Consecutive k-out-of-n: F system |
|
CMC(k\n:F) |
Circular Multistate Consecutive k-out-of-n: F system |
|
N1,N2,… Nn |
Independent and identically distributed components (Nodes) of the LMC(k\n:F) system |
|
M1,M2,...,Mn-k+1 |
Intermediate Nodes of the LMC(k\n: F) system |
|
Par(Xi) |
Parents of node Xi |
|
R |
Reliability |
|
SR |
System Reliability |
|
P |
Success Probability |
|
Q |
Failure Probability |
|
K |
Number of Consecutive Failure |
|
BN |
Bayesian Network |
|
BN R |
Bayesian Network Reliability |
|
BN LR |
Bayesian Network Linear system Reliability |
|
BN CR |
Bayesian Network Circular system Reliability |
|
MSS |
Multistate System |
|
DAG |
Directed Acyclic Graph |
|
CPTs |
Conditional Probability Tables |
|
CCFs |
Common Cause Failures |
[1] Chiang, D.T., Niu, S.C. (1981). Reliability of consecutive k-out-of-n: F system. IEEE Transactions on Reliability, 30: 87-89. https://doi.org/10.1109/TR.1981.5220981.
[2] Ross, S.M. (1979). Multivalued state component systems. The annals of Probability, 7(2): 379-383.
[3] Barlow, R.E., Wu, A.S. (1978). Coherent systems with multi-state components. Mathematics of Operations Research, 3(4): 275-281. https://doi.org/10.1287/moor.3.4.275
[4] El-Neweihi, E., Proschan, F., Sethuraman, J. (1978). Multistate coherent systems. Journal of Applied Probability, 15(4): 675-688. https://doi.org/10.2307/3213425
[5] Aven, T. (1985). Reliability evaluation of multistate systems with multistate components. IEEE Transactions on Reliability, 34(5): 473-479. https://doi.org/10.1109/TR.1985.5222235
[6] Levitin, G. (2003). Reliability of multi-state systems with two failure-modes. IEEE Transactions on Reliability, 52(3): 340-348. https://doi.org/10.1109/TR.2003.818714
[7] Zaitseva, E., Levashenko, V., Matiasko, K., Puuronen, S. (2005). Dynamic reliability indices for k-out-of-n multi-state system. In 35th International Symposium on Multiple-Valued Logic (ISMVL'05), Calgary, BC, Canada, pp. 264-269. https://doi.org/10.1109/ISMVL.2005.16
[8] Zaitseva, E., Levashenko, V. (2006). Dynamic reliability indices for parallel, series and k-out-of-n multi-state systems. In RAMS'06. Annual Reliability and Maintainability Symposium, Newport Beach, CA, USA, pp. 253-259. https://doi.org/10.1109/RAMS.2006.1677383
[9] Hudson, J.C., Kapur, K.C. (1982). Reliability theory for multistate systems with multistate components. Microelectronics Reliability, 22(1): 1-7. https://doi.org/10.1016/0026-2714(82)90045-2
[10] Hudson, J.C., Kapur, K.C. (1985). Reliability bounds for multistate systems with multistate components. Operations Research, 33(1): 153-160.
[11] Lisnianski, A., Levitin, G. (2003). Multi-state system reliability: Assessment, optimization and applications. World Scientific, 6: 376. https://doi.org/10.1142/5221
[12] Hwang, F.K., Yao, Y.C. (1989). Multistate consecutively-connected systems. IEEE Transactions on Reliability, 38(4): 472-474. https://doi.org/10.1109/24.46467
[13] Aggarwal, S., Agarwal, M., Gupta, R. (2007) A Heuristic approach for constrained redundancy optimization in multi-state systems. Stochastics and Quality Control, 22(2): 247-260. https://doi.org/10.1515/EQC.2007.247
[14] Zhai, S., Lin, S.Z. (2013). Bayesian networks application in multi-state system reliability analysis. In Applied Mechanics and Materials, Trans Tech Publications Ltd, 347-350: 2590-2595. https://doi.org/10.4028/www.scientific.net/AMM.347-350.2590
[15] Langseth, H., Portinale, L. (2007). Bayesian networks in reliability. Reliability Engineering & System Safety, 92(1): 92-108. https://doi.org/10.1016/j.ress.2005.11.037
[16] Wilson, A.G., Huzurbazar, A.V. (2007). Bayesian networks for multilevel system reliability. Reliability Engineering & System Safety, 92(10), 1413-1420. https://doi.org/10.1016/j.ress.2006.09.003
[17] Khakzad, N., Khan, F., Amyotte, P. (2011). Safety analysis in process facilities: Comparison of fault tree and Bayesian network approaches. Reliability Engineering & System Safety, 96(8): 925-932. https://doi.org/10.1016/j.ress.2011.03.012
[18] Cai, B., Liu, Y., Liu, Z., Tian, X., Dong, X., Yu, S. (2012). Using Bayesian networks in reliability evaluation for subsea blowout preventer control system. Reliability Engineering & System Safety, 108: 32-41. https://doi.org/10.1016/j.ress.2012.07.006
[19] Martins, M.R., Maturana, M.C. (2013). Application of Bayesian Belief networks to the human reliability analysis of an oil tanker operation focusing on collision accidents. Reliability Engineering & System Safety, 110: 89-109. https://doi.org/10.1016/j.ress.2012.09.008
[20] Mi, J., Li, Y.F., Peng, W., Huang, H.Z. (2018). Reliability analysis of complex multi-state system with common cause failure based on evidential networks. Reliability Engineering & System Safety, 174: 71-81. https://doi.org/10.1016/j.ress.2018.02.021
[21] Li, Y.F., Huang, H.Z., Mi, J., Peng, W., Han, X. (2022). Reliability analysis of multi-state systems with common cause failures based on Bayesian network and fuzzy probability. Annals of Operations Research, 311: 195-209. https://doi.org/10.1007/s10479-019-03247-6
[22] Amirian, Y., Khodadadi, A., Chatrabgoun, O. (2019). Exact reliability for a consecutive k-out-of-r-from-n: F system with equal and unequal component probabilities. An International Journal of AAM, 14(1): 99-116.
[23] Byun, J.E., Song, J. (2021). Generalized matrix-based Bayesian network for multi-state systems. Reliability Engineering & System Safety, 211: 107468. https://doi.org/10.1016/j.ress.2021.107468
[24] Jia, J.Z., Li, Z., Jia, P., Yang, Z.G. (2021). Reliability analysis of a complex multistate system based on a cloud bayesian network. Shock and Vibration, 2021: 1-27. https://doi.org/10.1155/2021/6660928
[25] Madhumitha, J., Vijayalakshmi, G. (2020). Bayesian estimation of linear/circular consecutive k-out-of-n: F system reliability. International Journal of Performability Engineering, 16(10): 1509-1516. https://doi.org/10.23940/ijpe.20.10.p2.15091516
[26] Bibartiu, O., Dürr, F., Rothermel, K., Ottenwälder, B., Grau, A. (2021). Scalable k-out-of-n models for dependability analysis with Bayesian networks. Reliability Engineering & System Safety, 210: 107533. https://doi.org/10.1016/j.ress.2021.107533
[27] Nashwan, I.I. (2021). Linear and circular r-gap-consecutive- K-out-of-M-from-N:F systems. International Journal of Scientific & Technology Research, 10: 346-352.
[28] Amirian, Y., Khodadadi, A. (2021). Modeling and exact reliability for a consecutive linear (k1, k2, ..., kn−r+1)−Out−of−r−from−n:F system and consecutive circular (k1, k2, ..., kn)−out−of−r−from−n:F system. International Journal of Reliability, Quality and Safety Engineering, 28(4): 2150029-2150029. https://doi.org/10.1142/S0218539321500297
[29] Jegatheesan, M., Gundala, V. (2022). Fuzzy Bayesian estimation of linear (circular) consecutive k-out-of-n: F system reliability. Trends in Sciences, 19(5): 2706-2706. https://doi.org/10.48048/tis.2022.2706
[30] Yin, J., Cui, L., Sun, Y., Balakrishnan, N. (2022). Reliability modelling for linear and circular k-out-of-n: F systems with shared components. Reliability Engineering & System Safety, 219: 108172. https://doi.org/10.1016/j.ress.2021.108172
