Analysis of Stochastic Reliability Characteristics of a Repairable 2-out-of-3 System with Minimal Repair at Failure

Yusuf, Ibrahim; Koki, Fatima Salman
August 2013
Applied Mathematics;Aug2013, Vol. 4 Issue 8, p1115
Academic Journal
In this paper, we study the reliability and availability characteristics of a repairable 2-out-of-3 system. Failure and repair times are assumed exponential. The explicit expressions of reliability and availability characteristics such as mean time to system failure (MTSF), steady-state availability, busy period and profit function are derived using Kolmogorov's forward equations method. Various cases are analyzed graphically to investigate the impact of system parameters on MTSF, availability, busy period and profit function


Related Articles

  • Edge Antimagic Total Labeling of Graphs. Raheem, A. // International Journal of Mathematical Combinatorics;Dec2015, Vol. 4, p66 

    The definition of (a, d)-edge-antimagic total labeling was introduced by Simanjuntak, Bertault and Miller as a natural extension of edge-magic labeling defined by Kotzig and Rosa. The present paper deals with a class of subdivided star for all possible values of the parameter d ∈ {0, 1, 2, 3}.

  • Graph Operations and Neighbor Rupture Degree. Kandİlcİ, Saadet; Bacak-Turan, Goksen; Polat, Refet // Journal of Applied Mathematics;2013, p1 

    In a communication network, the vulnerability parameters measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. A vertex subversion strategy of a graph G, say S, is a set of vertices in G whose closed neighborhood is removed...

  • Prehistoric Graph in Modal Derivations and Self-Referentiality. Yu, Junhua // Theory of Computing Systems;Feb2014, Vol. 54 Issue 2, p190 

    By terms-allowed-in-formulas capacity, Artemov's Logic of Proofs LP Artemov includes self-referential formulas of the form t: Ï•( t) that play a crucial role in the realization of modal logic S4 in LP, and in the Brouwer-Heyting-Kolmogorov semantics of intuitionistic logic via LP. In an...

  • Limit Complexities Revisited. Bienvenu, Laurent; Muchnik, Andrej; Shen, Alexander; Vereshchagin, Nikolay // Theory of Computing Systems;Oct2010, Vol. 47 Issue 3, p720 

    The main goal of this article is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result from Vereshchagin (Theor. Comput. Sci. 271(1–2):59–67, ) saying that lim sup n C( x| n) (here C( x| n) is conditional (plain)...

  • Effect of heterogeneous weights on the average trapping time and two types of random walks in weighted directed networks. Zhang, Huai; Zhang, Hongjuan // International Journal of Modern Physics B: Condensed Matter Phys;Feb2019, Vol. 33 Issue 5, pN.PAG 

    In this paper, we define a class of weighted directed networks with the weight of its edge dominated by a weight parameter w. According to the construction of the networks, we study two types of random walks in the weighted directed networks with a trap fixed on the central node, i.e., standard...

  • On the Kolmogorov constant in stochastic turbulence models. Heinz, Stefan // Physics of Fluids;Nov2002, Vol. 14 Issue 11, p4095 

    The Kolmogorov constant is fundamental in stochastic models of turbulence. To explain the reasons for observed variations of this quantity, it is calculated for two flows by various methods and data. Velocity fluctuations are considered as the sum of contributions due to anisotropy, acceleration...

  • A New Method for Characterization of Biological Particles in Microscopic Videos: Hypothesis Testing Based on a Combination of Stochastic Modeling and Graph Theory. Shojaedini, Seyed Vahab // Iranian Journal of Medical Physics;Summer2012, Vol. 9 Issue 3, p203 

    Introduction: Studying motility of biological objects is an important parameter in many biomedical processes. Therefore, automated analyzing methods via microscopic videos are becoming an important step in recent researches. Materials and Methods: In the proposed method of this article, a...

  • On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands. Louveaux, Fran�ois; Salazar-Gonz�lez, Juan-Jos� // Mathematical Programming;Jun2009, Vol. 119 Issue 1, p169 

    This paper studies how to set the vehicle capacity for traveling Salesman Problems where some of the customer demands are stochastic. The analyses are done for the one-commodity pickup-and-delivery TSP, as this problem also includes the setting of the initial load. The paper first considers...

  • Scenario tree modeling for multistage stochastic programs. Heitsch, Holger; R�misch, Werner // Mathematical Programming;May2009, Vol. 118 Issue 2, p371 

    An important issue for solving multistage stochastic programs consists in the approximate representation of the (multivariate) stochastic input process in the form of a scenario tree. In this paper, we develop (stability) theory-based heuristics for generating scenario trees out of an initial...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics