Reliability Computation of Moranda's Geometric Software Reliability Model

The Jelinski-Moranda (JM) model for software failures was one of the first models used for analyzing software reliability. Later Moranda proposed a modification of the JM model, labeled Geometric de-Eutrophication model. In the Moranda Geometric de-Eutrophication model, N(t) is defined as the number of faults detected in the time interval (0,t]. In this paper, N(t) is assumed to be a pure stochastic birth process, where failure rates decrease geometrically with a detection and rectifying of a fault. In this paper, a recursive scheme is proposed for studying the probability of detecting n bugs in the time (0,t]. The method uses a constructed table, which makes the method easier compared to other existing methods for computing Pn (t), the intensity function and the reliability Rτ (t). In the proposed procedure Pn (t) is the sum of (n+1) terms and each term is based on a factor, which can be from the above mentioned table.