Reliability Analysis of Six Unit Bridge and Parallel Series Networks With Critical and Non-Critical Human Errors
Journal Title: Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics - Year 2018, Vol 37, Issue 1
Abstract
Humans play a pivotal role in the design, development and operational phases of engineering systems. Reliability evaluation of systems without taking into consideration the human element does not provide a realistic picture. Hence, there is a definite need for incorporating the occurrence of human errors in system reliability evaluation. This paper presents reliability analysis of bridge and parallel-series networks with critical and non-critical Human errors. A newly developed approach is used to perform the system reliability analysis. The approach demonstrated in this paper, which consists of six unit bridge network, is a modified version of the block diagram approach.
Authors and Affiliations
T. Suvarna
Keywords
Related Articles
- EP ID EP531702
- DOI 10.5958/2320-3226.2018.00024.3
- Views 119
- Downloads 0
ON THE DEGENERATE LAPLACE TRANSFORM - I
We make an attempt in this paper to extend the very recent work of Kim and Kim [24] on degenerate Laplace transform. Using the definition of the degenerate Laplace transform as given by Kim and Kim [24] and some of the...
On Euler-Beta Transform of I-function of two variables
In this paper, the authors establish the Euler-Beta transform of various products involving a General Class of Polynomials, Struve’s function and I-function of two variables. Some similar formulae are also derived as s...
SKOLEM DIFFERENCE LUCAS MEAN LABELLING FOR SOME SPECIAL GRAPHS
A graph G with p vertices and q edges is said to have Skolem difference Lucas mean labelling if it is possible to label the vertices x∈v with distinct elements f(x) from the set {1,2,…,L_(p+q) } in such a way that the ed...
On Sequential Graphs
A labeling or valuation of a graph G is an assignment f of labels to the vertices of G that indices for each edge xy a label depending on the vertex labels f(x) and f(y). In this paper we study some classes of graphs whi...
On Harmonious Graphs
Let G = (V (G), E(G)) be a graph with q edges. A function f is called harmonious labeling of graph G if f:V→{0,1,2,...,q-1} is injective and the induced function f* : E → {0,1,2,...,q} defined as f*(uv) = (f(u) + f(v))(...