**Open Access Library Journal**

Vol.05 No.08(2018), Article ID:86677,13 pages

10.4236/oalib.1104767

Bayesian Predictive Analyses for Logarithmic Non-Homogeneous Poisson Process in Software Reliability

Nickson Cheruiyot, Luke Akong’o Orawo, Ali Salim Islam^{ }

Department of Mathematics, Egerton University, Egerton, Kenya

Copyright © 2018 by authors and Open Access Library Inc.

This work is licensed under the Creative Commons Attribution International License (CC BY 4.0).

http://creativecommons.org/licenses/by/4.0/

Received: July 10, 2018; Accepted: August 12, 2018; Published: August 15, 2018

ABSTRACT

This paper discusses the Bayesian approach to estimation and prediction of the reliability of software systems during the testing process. A Non-Homogeneous Poisson Process (NHPP) arising from the Musa-Okumoto (1984) software reliability model is proposed for the software failures. The Musa-Okumoto NHPP reliability model consists of two components―the execution time component and the calendar time component, and is a popular model in software reliability analysis. The predictive analyses of software reliability model are of great importance for modifying, debugging and determining when to terminate software development testing process. However, Bayesian and Classical predictive analyses on the Musa-Okumoto (1984) NHPP model is missing on the literature. This paper addresses four software reliability issues in single-sample prediction associated closely with development testing program. Bayesian approach based on non-informative prior was adopted to develop explicit solutions to these problems. Examples based on both real and simulated data are presented to illustrate the developed theoretical prediction results.

**Subject Areas:**

Mathematical Statistics

**Keywords:**

Non-Informative Priors, Non-Homogeneous Poisson Process, Bayesian Approach, Intensity Function, Software Reliability Model

1. Introduction

Software has become a driver for everything in the 21^{st} century from elementary education to genetic engineering. Thus due to high dependency, the size and complexity of computer systems have grown and these pose a great problem in their reliability as failures are prone to happen during their operations. To avoid the failures and faults, reliability of software needs to be studied during development of software so as to come up with reliable software. Reliability of software is of a lot of concern to the developers.

Software reliability is defined as the probability of failure free software operations for a specified period of time in a specified environment [1] . With the increasing need of software with zero defects, predicting reliability of software systems is gaining more and more importance [2] . Software reliability is achieved through testing during the software development stage [3] . Software Reliability modeling is done to estimate the form of the curve of the failure rate by statistically estimating the parameters associated with the selected model. In most cases, the reliability development of a complex system often take place by testing a system until it fails, then making repairs and design changes and testing it again. This process continues until a desired level of reliability is achieved [4] . The purpose of this measure is to estimate the extra execution time during test required to meet a specified reliability objective and to identify the expected reliability of the software when the product is released. During reliability modeling, the software systems are tested in an environment that resembles to the operational environment [5] .

Over the past decades many software reliability models that can be used for predictive analyses have been proposed by different authors [6] [7] . The Musa-Okumoto reliability model, also known as logarithmic was developed by Musa and Okumoto in 1984; which they confirmed to be more accurate than the exponential model. The Musa-Okumoto software reliability model is one of non-homogeneous Poisson process software models with the intensity function given by;

$\lambda \left(t\right)=\frac{\alpha \beta}{1+\beta t}$ (1)

The model is based on the assumptions that failures are observed during execution time caused by remaining faults in the software; whenever a failure is observed, an instantaneous effort is made to find what caused the failure and the faults are removed prior to future tests and whenever a repair is done it reduces the number of future faults not like other models. The model must remain stable during the entire testing period for any particular testing environment and a reasonably accurate prediction of reliability must be provided by the model. These are the two main aspects of a good reliability model [8] . The Musa-Okumoto (1984) model has been used in various testing environment and in many instances, it provides good estimation and prediction of software reliability. Compared to other models when used in testing industrial data set, Musa-Okumoto model is the best performer in terms of fitting and predictive capability to the data [5] .

There has been a lot of application of Musa-Okumoto software reliability growth model as it one of the best predictive models, it belongs to the selected models in the AIAA recommended practice standard on software reliability [9] , [10] . Musa-Okumoto model have been also used in software cost estimation models with high accuracy [11] [12] [13] . A critical review and categorization of software reliability have been done by many researchers [14] [15] . Predictive analyses on this model is missing in literature and this paper presents predictive analyses on Musa-Okumoto software reliability model using Bayesian approach. This paper presents Bayesian single-sample predictive inference for Musa-Okumoto software reliability model using Bayesian approach.

2. Bayesian Methodology

Bayesian method owes its name to the fundamental role of Bayes’ theorem. In Bayesian reasoning, uncertainty is attributed not only to data but also to the parameters. Therefore, all parameters are modelled by distributions. Before any data are obtained, the knowledge about the parameters of a problem are expressed in the prior distribution of the parameters. Given actual data, the prior distribution and the data are combined into the posterior distribution of the parameters. The posterior distribution summarizes our knowledge about the parameters after observing the data.

In this paper we assume that a reliability growth testing is performed on a computer software system and the number of failures in the time interval $\left(0,t\right]$ , denoted by $N\left(t\right)$ is observed. We also assume that $\left\{N\left(t\right),t>0\right\}$ follows the NHPP with intensity given in Equation (1). Let $0<{t}_{1}<{t}_{2}<\cdots $ be the successive failure times. When testing stops after a pre-determined n number of failures is observed, the failure data is said to be failure-truncated. We denote the n failures time by ${Y}_{obs}^{f}={\left[{t}_{i}\right]}_{i=1}^{n}$ where $0<{t}_{1}<{t}_{2}<\cdots <{t}_{n}$ , a time-truncated data is when testing is observed for fixed time t. We denote the corresponding observed data by ${Y}_{obs}^{t}=\left\{n,{t}_{1},\cdots ,{t}_{n};t\right\}$ , where $0<{t}_{1}<\cdots <{t}_{n}\le t$ .

2.1. Issues in Prediction

In this paper we present four issues 1) 2) 3) and 4) as listed below in single-sample prediction which are associated closely with development testing program of a software. Here, we consider one software and assume that its cumulative time between failure times obey Musa-Okumoto software reliability growth model with observed data as either ${Y}_{obs}^{f}$ or ${Y}_{obs}^{t}$ . Based on ${Y}_{obs}^{f}$ or ${Y}_{obs}^{t}$ , we are interested in the following problems:

1) What is the probability that at most k software failure will occur in the future time period $\left(T,\tau \right]$ with $\tau >T$ ?

2) Given that the pre-determined target value ${\lambda}_{tv}$ for the failure rate of the software undergoing development testing is not achieved at time T, what is the probability that the target value ${\lambda}_{tv}$ will be achieved at time $\tau ,\tau >T$ ?

3) Suppose that the target value ${\lambda}_{tv}$ for the software failure rate is not achieved at time T, how long will it take so that the software failure rate will be attained at ${\lambda}_{tv}$ ?

4) What is the upper prediction limit (UPL) of ${\lambda}_{\tau}=\alpha \beta /\left(1+\beta \tau \right)$ with level $\gamma $ . $\tau $ being a pre-determined value greater than T?

2.2. Prior, Posterior and Predictive Distributions

Let ${Y}_{obs}$ represent ${Y}_{obs}^{f}$ or ${Y}_{obs}^{t}$ . The joint density of ${Y}_{obs}$ is therefore :

$f\left({Y}_{obs}/\alpha ,\beta \right)={\left(\alpha \beta \right)}^{n}{\displaystyle \underset{i=1}{\overset{n}{\prod}}{\left(1+\beta {t}_{i}\right)}^{-1}{\text{e}}^{\left(-\alpha \mathrm{ln}\left(1+\beta T\right)\right)}},\text{\hspace{0.17em}}\text{\hspace{0.17em}}\alpha >0,\beta >0$ (2)

Case 1: $\beta $ , the shape parameter is known, we adopt the following non-informative prior distribution for $\alpha $ :

$\pi \left(\alpha \right)\propto \frac{1}{\alpha},\text{\hspace{0.17em}}\text{\hspace{0.17em}}\alpha >0$ (3)

The posterior distribution of $\alpha $ is thus given by;

$h\left(\alpha /{Y}_{obs}\right)={\left[\Gamma \left(n\right)\right]}^{-1}{\alpha}^{n-1}{\left(\mathrm{ln}\left(1+\beta T\right)\right)}^{n}{\text{e}}^{\left(-\alpha \mathrm{ln}\left(1+\beta T\right)\right)}$ (4)

Let $\stackrel{\u02dc}{y}$ be the random variable being predicted. The predictive density of $\stackrel{\u02dc}{y}$ is;

$f\left(\stackrel{\u02dc}{y}/{Y}_{obs}\right)={\displaystyle \underset{0}{\overset{\infty}{\int}}f\left(\stackrel{\u02dc}{y}/{Y}_{obs}\right)h\left(\alpha /{Y}_{obs}\right)\text{d}\alpha}$ (5)

Hence, the Bayesian UPL of $\stackrel{\u02dc}{y}$ with level $\gamma $ , denoted as ${y}_{U}^{\left(\beta \right)}$ , must satisfy

$\gamma ={\displaystyle \underset{-\infty}{\overset{{y}_{U}^{\left(\beta \right)}}{\int}}f\left(y/{Y}_{obs}\right)\text{d}y}$ (6)

Case 2: The shape parameter $\beta $ is unknown; we consider the following joint prior distribution of $\alpha $ and $\beta $ where both parameters are assumed to be independent.

$\pi \left(\alpha ,\beta \right)\propto \frac{1}{\alpha \beta},\text{\hspace{0.17em}}\alpha ,\beta >0$ (7)

Thus the corresponding joint posterior distribution for $\alpha $ and $\beta $ is given as;

$h\left(\alpha ,\beta /{Y}_{obs}\right)={\left[k\Gamma \left(n\right)\right]}^{-1}{\alpha}^{n-1}{\beta}^{n-1}{\displaystyle \underset{i=1}{\overset{n}{\prod}}{\left(1+\beta {t}_{i}\right)}^{-1}{\text{e}}^{\left(-\alpha \mathrm{ln}\left(1+\beta T\right)\right)}}$ (8)

Equation (8) is similar to Equation (4), let $\stackrel{\u02dc}{y}$ be the random variable predicted. The predictive density of $\stackrel{\u02dc}{y}$ is;

$f\left(\stackrel{\u02dc}{y}/{Y}_{obs}\right)={\displaystyle \underset{0}{\overset{\infty}{\int}}{\displaystyle \underset{0}{\overset{\infty}{\int}}f\left(\stackrel{\u02dc}{y}/{Y}_{obs},\alpha ,\beta \right)h\left(\alpha ,\beta /{Y}_{obs}\right)\text{d}\alpha \text{d}\beta}}$ (9)

and the Bayesian UPL denoted by ${y}_{U}$ of $\stackrel{\u02dc}{y}$ with level $\gamma $ similar to Equation (6) is;

$\gamma ={\displaystyle \underset{-\infty}{\overset{{y}_{U}}{\int}}f\left(\stackrel{\u02dc}{y}/{Y}_{obs}\right)\text{d}y}$ (10)

3. Main Results for Prediction Using Non-Informative Priors

In this section we address the four issues stated in Section 2.1 using the Bayesian approach. The main results are presented as propositions and their proof given in the Appendix. Below, we use ${\chi}^{2}\left(n;\gamma \right)$ to represent $\gamma $ the percentage point of the chi-square distribution with n degrees of freedom such that $\mathrm{Pr}\left\{{\chi}^{2}\left(n\right)\le {\chi}^{2}\left(n;\gamma \right)\right\}=\gamma $ , and define Poisson $\left(h/\theta \right)={\theta}^{h}{\text{e}}^{-\theta}/h!$ and gamma $\left(x/n,\lambda \right)={\lambda}^{n}{x}^{n-1}{\text{e}}^{-\lambda n}/\Gamma \left(n\right)$ . The prior is assumed to be Equation (3) and Equation (7) in all subsequent propositions.

Preposition 1 (issue 1)

The probability that at most k failures will occur in the time interval $\left(T,\tau \right]$ with $\tau >T$ is

${\gamma}_{k}=\{\begin{array}{l}\frac{{\left[\mathrm{ln}\left(1+\beta T\right)\right]}^{n}}{{\left[\mathrm{ln}\left(\frac{1+\beta \tau}{1+\beta T}\right)\right]}^{n}}{\displaystyle \underset{j=n}{\overset{n+k}{\sum}}\left(\begin{array}{c}j-n\\ n-1\end{array}\right)\frac{{\left[\mathrm{ln}\left(\frac{1+\beta \tau}{1+\beta T}\right)\right]}^{j}}{{\left[\mathrm{ln}\left(1+\beta \tau \right)\right]}^{j}}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{if}\text{\hspace{0.17em}}\beta \text{\hspace{0.17em}}\text{is}\text{\hspace{0.17em}}\text{known}\\ {\displaystyle \underset{j=n}{\overset{n+k}{\sum}}\frac{\Gamma \left(j\right)}{d\left(j-n\right)!\Gamma \left(n\right)}{\displaystyle \underset{0}{\overset{\infty}{\int}}\frac{{\beta}^{n-1}{\displaystyle \underset{i=1}{\overset{n}{\prod}}{\left(1+\beta {t}_{i}\right)}^{-1}}}{{\left[\mathrm{ln}\left(1+\beta \tau \right)\right]}^{j}}{\left[\mathrm{ln}\left(\frac{1+\beta \tau}{1+\beta T}\right)\right]}^{j-n}\text{d}\beta}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{if}\text{\hspace{0.17em}}\beta \text{\hspace{0.17em}}\text{is}\text{\hspace{0.17em}}\text{unknown}\end{array}$ (11)

Preposition 2 (issue 2)

The probability that the target value ${\lambda}_{tv}$ will be achieved at time $\tau $ ( $\tau >T$ ) is

${\gamma}_{k}=\{\begin{array}{l}1-{\displaystyle \underset{h=0}{\overset{n-1}{\sum}}\frac{{\left[\left(\frac{1+\beta \tau}{\beta}\right){\lambda}_{\tau}\mathrm{ln}\left(1+\beta T\right)\right]}^{h}}{h!}{\text{e}}^{-{\lambda}_{\tau}\left(\frac{1+\beta \tau}{\beta}\right)\mathrm{ln}\left(1+\beta T\right)}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{if}\text{\hspace{0.17em}}\beta \text{\hspace{0.17em}}\text{is}\text{\hspace{0.17em}}\text{known}\\ 1-\frac{1}{k}{\displaystyle \underset{h=0}{\overset{n-1}{\sum}}{\displaystyle \underset{0}{\overset{\infty}{\int}}\frac{{\left[\left(\frac{1+\beta \tau}{\beta}\right){\lambda}_{tv}\mathrm{ln}\left(1+\beta T\right)\right]}^{h}}{h!}\frac{{\beta}^{n-1}{\displaystyle \underset{i=1}{\overset{n}{\prod}}{\left(1+\beta {t}_{i}\right)}^{-1}}}{{\left[\mathrm{ln}\left(1+\beta T\right)\right]}^{n}}{\text{e}}^{-{\lambda}_{tv}\left(\frac{1+\beta \tau}{\beta}\right)\mathrm{ln}\left(1+\beta T\right)}\text{d}\beta \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{if}\text{\hspace{0.17em}}\beta \text{\hspace{0.17em}}\text{is}\text{\hspace{0.17em}}\text{unknown}}}\end{array}$ (12)

Preposition 3 (issue 3)

For a given level $\gamma $ , the time ${\tau}^{\ast}$ required to attain ${\lambda}_{tv}$ is

${\tau}^{\ast}=\{\begin{array}{l}\begin{array}{c}\left[\frac{{\chi}^{2}\left(2n;\gamma \right)}{2{\lambda}_{tv}\mathrm{ln}\left(1+\beta T\right)}-\frac{1}{\beta}\right]-T\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{if}\text{\hspace{0.17em}}\beta \text{\hspace{0.17em}}\text{is}\text{\hspace{0.17em}}\text{known}\\ \end{array}\\ \tau -T\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{if}\text{\hspace{0.17em}}\beta \text{\hspace{0.17em}}\text{is}\text{\hspace{0.17em}}\text{unknown}\end{array}$ (13)

Remark 1: For the second part of Equation (13), $\tau $ is the solution to the equation

$\gamma =1-\frac{1}{k}{\displaystyle \underset{h=0}{\overset{n-1}{\sum}}{\displaystyle \underset{0}{\overset{\infty}{\int}}\frac{{\left[{\lambda}_{\tau}\frac{1+\beta \tau}{\beta}\mathrm{ln}\left(1+\beta T\right)\right]}^{h}}{h!}{\text{e}}^{-{\lambda}_{\tau}\frac{1+\beta \tau}{\beta}\mathrm{ln}\left(1+\beta T\right)}\cdot \frac{{\beta}^{n-1}{\displaystyle \underset{i=1}{\overset{n}{\prod}}{\left(1+\beta {t}_{i}\right)}^{-1}}}{{\left[\mathrm{ln}\left(1+\beta T\right)\right]}^{n}}\text{d}\beta}}$ . (14)

Preposition 4 (issue 4)

The Bayesian UPL of ${\lambda}_{\tau}=\frac{\alpha \beta}{1+\beta \tau}$ with level $\gamma $ is

${\lambda}_{U}^{\left(\beta \right)}\left(\tau \right)=\{\begin{array}{l}\frac{\beta {\chi}^{2}\left(2n;\gamma \right)}{2\left(1+\beta \tau \right)\mathrm{ln}\left(1+\beta T\right)}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{if}\text{\hspace{0.17em}}\beta \text{\hspace{0.17em}}\text{is}\text{\hspace{0.17em}}\text{known}\\ {\lambda}_{tv}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{if}\text{\hspace{0.17em}}\beta \text{\hspace{0.17em}}\text{is}\text{\hspace{0.17em}}\text{unknown}\end{array}$ (15)

Remark 2: For the second part of Equation (15), ${\lambda}_{tv}$ is the solution to

$\gamma =1-\frac{1}{k}{\displaystyle \underset{h=0}{\overset{n-1}{\sum}}{\displaystyle \underset{0}{\overset{\infty}{\int}}\frac{{\left[{\lambda}_{tv}\frac{1+\beta \tau}{\beta}\mathrm{ln}\left(1+\beta T\right)\right]}^{h}}{h!}{\text{e}}^{-{\lambda}_{tv}\frac{1+\beta \tau}{\beta}\mathrm{ln}\left(1+\beta T\right)}\cdot \frac{{\beta}^{n-1}{\displaystyle \underset{i=1}{\overset{n}{\prod}}{\left(1+\beta {t}_{i}\right)}^{-1}}}{{\left[\mathrm{ln}\left(1+\beta T\right)\right]}^{n}}\text{d}\beta}}$ (16)

4. Real Example

We have used the time between failures data described in [16] to illustrate the developed methodologies for the single-sample Bayesian predictive analysis. We conducted the goodness of fit test presented in [17] and found that the data obey the Musa-Okumoto process. On the basis of this data set the maximum likelihood estimates for the parameters $\alpha $ and $\beta $ of the Musa-Okumoto growth model were obtained as $\stackrel{^}{\beta}=\text{0}\text{.008282448}$ and $\stackrel{^}{\alpha}=\text{15}\text{.285550499}$ , respectively.

1) Suppose we are interested in the probability ${\gamma}_{k}$ that at most k failures will occur in a future time period $\left(T,\tau \right]=\left(180,250\right]$ . a) For the case $\beta $ known, we take its maximum likelihood estimate as its true value, i.e. $\beta =0.008282448$ . Using the first formula in Equation (11), we have ${\gamma}_{0}=0.00204337$ , ${\gamma}_{1}=0.01347748$ , ${\gamma}_{2}=0.04653484$ , ${\gamma}_{3}=0.11230530$ , ${\gamma}_{4}=0.21351423$ , ${\gamma}_{5}=0.34188371$ , ${\gamma}_{6}=0.48155675$ , ${\gamma}_{7}=0.61554018$ , ${\gamma}_{8}=0.73112395$ , ${\gamma}_{9}=0.82215131$ , ${\gamma}_{10}=0.88836847$ , ${\gamma}_{11}=0.93328146$ , ${\gamma}_{12}=0.96190403$ ,${\gamma}_{13}=0.97915241$ , ${\gamma}_{14}=0.98903392$ , ${\gamma}_{15}=0.99444044$ . b) When $\beta $ is unknown, from the second formula of Equation (33), we obtain ${\gamma}_{0}=0.002423218$ , ${\gamma}_{1}=0.015348190$ , ${\gamma}_{2}=0.052195351$ , ${\gamma}_{3}=0.122789747$ , ${\gamma}_{4}=0.229662151$ , ${\gamma}_{5}=0.362653362$ , ${\gamma}_{5}=0.362653362$ , ${\gamma}_{7}=0.639743372$ , ${\gamma}_{8}=0.750133795$ , ${\gamma}_{9}=0.836483617$ , ${\gamma}_{10}=0.897655409$ , ${\gamma}_{11}=0.941055333$ , ${\gamma}_{12}=0.963420189$ , ${\gamma}_{13}=0.981411270$ , ${\gamma}_{13}=0.981411270$ , ${\gamma}_{15}=0.991582449$ Figure 1 shows the graph of desired probabilities when $\beta $ is known and when it is unknown.

From the graph it can be seen that there is high probability that at most 15 failures will occur during that time interval when $\beta $ is unknown as compared to when it is known. 2) Suppose the target value is given by ${\lambda}_{tv}=0.03$ chosen arbitrarily. At the time $T=182.21$ , the MLE of the achieved failure rate for this software is $\stackrel{^}{\lambda}\left(182.21\right)=\stackrel{^}{\alpha}\stackrel{^}{\beta}/\left(1+182.21\stackrel{^}{\beta}\right)=\text{0}\text{.05045615}$ , which is greater than ${\lambda}_{tv}$ thus it cannot be achieved at time $T=182.21$ and development testing will continue. Suppose we want to find the probability that the target value ${\lambda}_{tv}$ will be achieved at the time $\tau =277.83\text{\hspace{0.17em}}\text{h}$ . a) When $\beta $ is known (say, $\beta =0.008282448$ ), from the first formula in Equation (12), we obtain

Figure 1. The graph of the probabilities ${\gamma}_{k}$ that at most k failures will occur in the time interval (180, 250] for the cases of $\beta $ known and unknown.

$\gamma =\text{1}\text{.687506e}-\text{06}$ , which is very small and hence the target valuewill not be achieved. b) when $\beta $ is unknown, from the second formula in Equation (12) we have $\gamma =\text{0}\text{.193896}$ computed by the Monte Carlo Method of integration based on a sample of size $L=1000$ . This shows that, when $\beta $ is unknown there is a possibility of achieving the target value at time $\tau =277.83\text{\hspace{0.17em}}\text{h}$ .

3) Since the target value ${\lambda}_{tv}$ was not achieved at $T=182.21$ , we want to know how long it will take for the target value to be achieved. a) when $\beta $ is known (say, $\beta =0.008282448$ ), let $\gamma =0.90$ , from the first formula in Equation (13) we obtain ${\tau}^{\ast}=\text{538}\text{.7523}\text{\hspace{0.17em}}\text{h}$ . This means that, it will take another 538.7523 hours in order to achieve the desired failure rate. b) when $\beta $ is unknown, from second formula in Equation (13) and Remark1, we obtain ${\tau}^{\ast}=414\text{\hspace{0.17em}}\text{h}$ . Thus, it takes another 414 hours in order to achieve the desired failure rate when $\beta $ is unknown this shows a high reduction in time as compared to when $\beta $ is known. 4) Given $\tau =900\text{\hspace{0.17em}}\text{h}$ , from first formula in Equation (15)

the Bayesian UPL of ${\lambda}_{\tau}=\frac{\alpha \beta}{1+\beta \tau}$ with level $\gamma =0.90$ is given by

${\lambda}_{U}^{\left(\beta \right)}\left(\tau \right)=\text{0}\text{.02473799}$ .

5. Conclusions

In software development, predictive analysis is very important as it helps the software developer to make a trade-off decision at the right time. In this paper, explicit solution to predictive issues that may arise during development process were derived using Bayesian approach. These solutions are helpful to software developers in many instances such as resource allocation, when to terminate the testing process, modification needed in the software before termination.

The study used Bayesian approach with non-informative priors to derived explicit solutions for predictive issues that may arise during software development process. In all the cases when the shape parameter was known, solutions to posterior and predictive distributions had closed forms while when it is unknown, solutions had no closed forms and the study used Markov Chain Monte Carlo (MCMC). Bayesian approach was used as it is advantageous over classical approach. Bayesian approach is available for small sample sizes and allows the input of prior information about reliability growth process and provides full posterior and predictive distributions [6] .

However, it will be interesting to look at two-sample prediction for Musa-Okumoto (1984) model considering procedures that [3] used. These procedures presented in this paper can also be extended to other NHPP models such as Cox-Lewis process and the delayed S-shaped process. This is left open for future research.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

Cite this paper

Cheruiyot, N., Orawo, L.A. and Islam, A.S. (2018) Bayesian Predictive Analyses for Logarithmic Non-Homogeneous Poisson Process in Software Reliability. Open Access Library Journal, 5: e4767. https://doi.org/10.4236/oalib.1104767

References

- 1. Nuria, T.R. (2011) Stochastic Comparisons and Bayesian Inference in Software Reliability. Ph.D. Thesis, Universidad Carlos III de Madrid, Madrid.
- 2. Sonia, D. and Renu, D. (2014) A Study of Various Reliability Growth Models. International Journal of Advanced Research in Computer Science and Software Engineering, 4, 1213-1219.
- 3. Daniel, R.J. and Hoang, P. (2001). On the Maximum Likelihood Estimates for the Goel-Okumoto Software Reliability Model. The American Statistician, 55, 219-222.

https://doi.org/10.1198/000313001317098211 - 4. Muralidharan, K., Rupal, S. and Deepak, H.D. (2008) Future Reliability Estimation Based on Predictive Distribution in Power Law Process. Quality Technology & Quantitative Management, 5, 193-201.

https://doi.org/10.1080/16843703.2008.11673396 - 5. Ullah, N., Morisio, M. and Vetro, A. (2013) A Comparative Analysis of Software Reliability Growth Models Using Defects Data of Closed and Open Source Software. In: 35th Annual IEEE Software Engineering Workshop, Heraclion, 12-13 October 2012, 187-192.
- 6. Yu, J.-W., Tian, G.-L. and Tang, M.-L. (2007) Predictive Analyses for Non-Homogeneous Poisson Processes with Power Law Using Bayesian Ap-proach. Computational Statistics & Data Analysis, 51, 4254-4268.

https://doi.org/10.1016/j.csda.2006.05.010 - 7. Akuno, A.O., Orawo, L.A. and Islam, A.S. (2014) One-Sample Bayesian Predictive Analyses for an Exponential Non-Homogeneous Poisson Process in Software Reliability. Open Journal of Statistics, 4, 402-411.

https://doi.org/10.4236/ojs.2014.45039 - 8. Kapur, P.K., Pham, H., Gupta, A. and Jha, P.C. (2011) Software Reliability Assessment with OR Applications. Springer Series in Reliability Engineering, Springer-Verlag, London, 58.

https://doi.org/10.1007/978-0-85729-204-9 - 9. Lyu, M. (1996) Handbook of Software Reliability Engineering. McGraw-Hill, New York.
- 10. Malaiya, Y.K. and Denton, J. (1997) What Do the Software Reliability Growth Model Parameters Represent? Technical Report CS-97-115, Department of Computer Science, Colorado State University, Fort Collins.
- 11. Xia, W., Capretz, L.F. and Ho, D. (2008) A Neuro-Fuzzy Model for Function Point Calibration. WSEAS Transactions on Information Science and Applications, 5, 22-30.
- 12. Nassif, A.B., Capretz, L.F. and Ho, D. (2010) Software Estimation in the Early Stages of the Software Life Cycle. In: International Conference on Emerging Trends in Computer Science, Communication and Information Technology, Nanded, 9-11 January, 5-13.
- 13. Nassif, A.B., Ho, D. and Capretz, L.F., (2013) Towards an Early Software Estimation Using Log-Linear Regression and a Multilayer Perceptron Model. Journal of Systems and Software, 86, 144-160.

https://doi.org/10.1016/j.jss.2012.07.050 - 14. Yadav, A. and Khan, R.A. (2009) Critical Review on Software Reliability Models. International Journal of Recent Trends in Engineering, 2, 114-116.
- 15. Sheakh, T.H., Quadri, S.M.K. and Singh, V. (2012) Critical Review of Software Reliability Model. International Journal of Emerging Technology and Advance Engineering, 2, 496-499.
- 16. Xie, M., Goh, T.N. and Ranjan, P. (2002) Some Effective Control Chart Procedures for Reliability Monitoring. Reliability Engineering & System Safety, 77, 143-150.

https://doi.org/10.1016/S0951-8320(02)00041-8 - 17. Zhao, J. and Wang, J. (2005) A New Goodness-of-Fit Test Based on the Laplace Statistic for a Large Class of NHPP Models. Communications in Statistics—Simulation and Computation, 34, 725-736.

https://doi.org/10.1081/SAC-200068389

Appendix: Proof of Preposition 1 - 4

We first state the following identity without proof: That is

$\underset{D\left(m;a,b\right)}{\int}\text{d}F\left({t}_{1}\right)\cdots \text{d}F\left({t}_{m}\right)}={\left[F\left(a\right)-F\left(b\right)\right]}^{m}/m!$ (A.1)

where m is any positive integer, a and b are two real numbers such that $a<b$ , $F\left(t\right)$ is an increasing and differentiable function and

$D\left(m;a,b\right)\stackrel{\wedge}{=}\left\{\left({t}_{1},\cdots ,{t}_{m}\right):a<{t}_{1}<\cdots <{t}_{m}<b\right\}$ .

Proof of Proposition 1

The probability that at most k failures will occur in the interval $\left(T,\tau \right]$ is ${\gamma}_{k}=\mathrm{Pr}\left\{N\left(\tau \right)\le n+k/{Y}_{obs}\right\}$ . When $\beta $ is known, we have

${\gamma}_{k}={\displaystyle \underset{0}{\overset{\infty}{\int}}\mathrm{Pr}\left\{N\left(\tau \right)\le n+k/{Y}_{obs},\alpha \right\}\cdot h\left(\alpha /{Y}_{obs}\right)\text{d}\alpha}$ . (A.2)

where $h\left(\alpha /{Y}_{obs}\right)$ is given by equation (4) and

$\mathrm{Pr}\left[N\left(\tau \right)\le n+k/{Y}_{obs},\alpha \right]={\displaystyle \underset{j=n}{\overset{n+k}{\sum}}f\left({Y}_{obs},N\left(\tau \right)=j/\alpha \right)/f\left({Y}_{obs}/\alpha \right)}$ (A.3)

From Equation (2), we have $f\left({Y}_{obs}/\alpha \right)={\beta}^{n}{\alpha}^{n}{\displaystyle \underset{i=1}{\overset{n}{\prod}}{\left(1+\beta {t}_{i}\right)}^{-1}{\text{e}}^{\left[-\alpha \mathrm{ln}\left(1+\beta T\right)\right]}}$ , and

$\begin{array}{l}f\left({Y}_{obs},N\left(\tau \right)=j/\alpha \right)\\ ={\displaystyle {\int}_{D\left(j-n;T,\tau \right)}f\left({Y}_{obs},{x}_{n+1},\cdots ,{x}_{j},N\left(\tau \right)=j\right){\displaystyle \underset{\mathcal{l}=n+1}{\overset{j}{\prod}}\text{d}{x}_{\mathcal{l}}}}\\ ={\displaystyle {\int}_{D\left(j-n,T,\tau \right)}{\alpha}^{j}{\beta}^{j}{\text{e}}^{\left[-\alpha \mathrm{ln}\left(1+\beta T\right)\right]}{\displaystyle \underset{i=1}{\overset{j}{\prod}}{\left(1+\beta {t}_{i}\right)}^{-1}}{\displaystyle \underset{\mathcal{l}=n+1}{\overset{j}{\prod}}\text{d}{t}_{\mathcal{l}}}}\\ ={\alpha}^{j}{\beta}^{j}{\displaystyle \underset{i=1}{\overset{n}{\prod}}{\left(1+\beta {t}_{i}\right)}^{-1}{\text{e}}^{\left[-\alpha \mathrm{ln}\left(1+\beta T\right)\right]}}{\displaystyle {\int}_{D\left(j-n,T,\tau \right)}{\displaystyle \underset{\mathcal{l}=n+1}{\overset{j}{\prod}}{\left(1+\beta {t}_{\mathcal{l}}\right)}^{-1}}{\displaystyle \underset{\mathcal{l}=n+1}{\overset{j}{\prod}}\text{d}{t}_{\mathcal{l}}}}\end{array}$

Thus Equation (A.3) becomes

$\mathrm{Pr}\left[N\left(\tau \right)\le n+k/{Y}_{obs}\right]=\frac{{\displaystyle \underset{j=n}{\overset{n+k}{\sum}}{\alpha}^{j-n}{\text{e}}^{\left[-\alpha \mathrm{ln}\left(\frac{1+\beta \tau}{1+\beta T}\right)\right]}{\left[\mathrm{ln}\left(\frac{1+\beta \tau}{1+\beta T}\right)\right]}^{j-n}}}{\left(j-n\right)!}$ (A.4)

And hence Equation (A.2) becomes

$\begin{array}{c}{\gamma}_{k}={\displaystyle \underset{0}{\overset{\infty}{\int}}{\displaystyle \underset{j=n}{\overset{n+k}{\sum}}{\alpha}^{j-n}{\text{e}}^{\left[-\alpha \mathrm{ln}\left(\frac{1+\beta \tau}{1+\beta T}\right)\right]}\frac{{\left[\mathrm{ln}\left(\frac{1+\beta \tau}{1+\beta T}\right)\right]}^{j-n}{\alpha}^{n-1}{\left[\mathrm{ln}\left(1+\beta T\right)\right]}^{n}{\text{e}}^{\left[-\alpha \mathrm{ln}\left(1+\beta T\right)\right]}}{\left(j-n\right)!\Gamma \left(n\right)}\text{d}\alpha}}\\ ={\displaystyle \underset{j=n}{\overset{n+k}{\sum}}\frac{{\left[\mathrm{ln}\left(\frac{1+\beta \tau}{1+\beta T}\right)\right]}^{j-n}{\left[\mathrm{ln}\left(1+\beta T\right)\right]}^{n}}{\left(j-n\right)!\Gamma \left(n\right)}}\frac{\Gamma \left(j\right)}{{\left[\mathrm{ln}\left(1+\beta \tau \right)\right]}^{j}}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\times {\displaystyle \underset{0}{\overset{\infty}{\int}}\frac{{\left[\mathrm{ln}\left(1+\beta \tau \right)\right]}^{j}}{\Gamma \left(j\right)}{\alpha}^{j-n}{\text{e}}^{\left[-\alpha \mathrm{ln}\left(1+\beta \tau \right)\right]}\text{d}\alpha}\end{array}$ (A.5)

The integral part of Equation (A.5) integrates to 1 since it is a gamma distribution with parameters j and $\mathrm{ln}\left(1+\beta \tau \right)$ and hence Equation (A.5) reduces to

${\gamma}_{k}=\frac{{\left[\mathrm{ln}\left(1+\beta T\right)\right]}^{n}}{{\left[\mathrm{ln}\left(\frac{1+\beta \tau}{1+\beta T}\right)\right]}^{n}}{\displaystyle \underset{j=n}{\overset{n+k}{\sum}}\left(\begin{array}{c}j-n\\ n-1\end{array}\right)\frac{{\left[\mathrm{ln}\left(\frac{1+\beta \tau}{1+\beta T}\right)\right]}^{j}}{{\left[\mathrm{ln}\left(1+\beta \tau \right)\right]}^{j}}}$ . (A.6)

This is the first formula of Equation (11).

When $\beta $ is unknown, noting that $\mathrm{Pr}\left\{N\left(\tau \right)\le n+k/{Y}_{obs},\alpha ,\beta \right\}$ and $h\left(\alpha ,\beta /{Y}_{obs}\right)$ are given by Equation (A.4) and Equation (8) respectively, we obtain

$\begin{array}{c}{\gamma}_{k}={\displaystyle \underset{0}{\overset{\infty}{\int}}{\displaystyle \underset{0}{\overset{\infty}{\int}}\mathrm{Pr}\left[N\left(\tau \right)\le n+k/{Y}_{obs},\alpha ,\beta \right]}\cdot h\left(\alpha ,\beta /{Y}_{obs}\right)\text{d}\alpha \text{d}\beta}\\ ={\displaystyle \underset{j=n}{\overset{n+k}{\sum}}\frac{1}{\left(j-n\right)!\Gamma \left(n\right)}{\displaystyle \underset{0}{\overset{\infty}{\int}}{\displaystyle \underset{0}{\overset{\infty}{\int}}{\alpha}^{j-1}{\beta}^{n-1}{\displaystyle \underset{i=1}{\overset{n}{\prod}}{\left(1+\beta {t}_{i}\right)}^{-1}}{\left[\mathrm{ln}\left(\frac{1+\beta \tau}{1+\beta T}\right)\right]}^{j-n}{\text{e}}^{\left[-\alpha \mathrm{ln}\left(1+\beta \tau \right)\right]}\text{d}\alpha \text{d}\beta}}}\\ ={\displaystyle \underset{j=n}{\overset{n+k}{\sum}}\frac{\Gamma \left(j\right)}{d\left(j-n\right)!\Gamma \left(n\right)}{\displaystyle \underset{0}{\overset{\infty}{\int}}\frac{{\beta}^{n-1}{\displaystyle \underset{i=1}{\overset{n}{\prod}}{\left(1+\beta {t}_{i}\right)}^{-1}}}{{\left[\mathrm{ln}\left(1+\beta \tau \right)\right]}^{j}}}}{\left[\mathrm{ln}\left(\frac{1+\beta \tau}{1+\beta T}\right)\right]}^{j-n}\text{d}\beta \end{array}$ (A.7)

Since the summation of k is from n to $n+k$ and k’s are not the same, we substitute letter k with d in Equation (A.7) where $d=k$ as used in equation (8). Equation (A.7) implies the second formula in Equation (11). $\square $

Proof of preposition 2

Let $f\left({\lambda}_{\tau}/{Y}_{obs}\right)$ denote the posterior of ${\lambda}_{\tau}=\alpha \beta /\left(1+\beta \tau \right)$ . Hence, the probability that the target value ${\lambda}_{tv}$ will be achieved at time $\tau $ is given by

$\gamma =\mathrm{Pr}\left\{{\lambda}_{\tau}\le {\lambda}_{tv}/{Y}_{obs}\right\}={\displaystyle \underset{0}{\overset{{\lambda}_{tv}}{\int}}f\left({\lambda}_{\tau}/{Y}_{obs}\right)\text{d}{\lambda}_{\tau}}$ (A.8)

when $\beta $ is known, making transformation ${\lambda}_{\tau}=\alpha \beta /\left(1+\beta \tau \right)$ , we have $\alpha ={\lambda}_{\tau}\frac{1+\beta \tau}{\beta}$ and $\frac{\text{d}\alpha}{\text{d}{\lambda}_{\tau}}=\frac{1+\beta \tau}{\beta}$ . Consequently, the posterior density of ${\lambda}_{\tau}$ is

$f\left({\lambda}_{\tau}/{Y}_{obs}\right)=h\left(\alpha /{Y}_{obs}\right)\left|\frac{\text{d}\alpha}{\text{d}{\lambda}_{\tau}}\right|$

$\begin{array}{c}f\left({\lambda}_{\tau}/{Y}_{obs}\right)=\frac{1}{\Gamma \left(n\right)}{\left[\frac{{\lambda}_{\tau}\left(1+\beta \tau \right)}{\beta}\right]}^{n-1}{\left[\mathrm{ln}\left(1+\beta T\right)\right]}^{n}{\text{e}}^{-{\lambda}_{\tau}\left(\frac{1+\beta \tau}{\beta}\right)\mathrm{ln}\left(1+\beta T\right)}\cdot \frac{1+\beta \tau}{\beta}\\ =\frac{1}{\Gamma \left(n\right)}{\left[\left(\frac{1+\beta \tau}{\beta}\right)\mathrm{ln}\left(1+\beta T\right)\right]}^{n}{\lambda}_{\tau}^{n-1}{\text{e}}^{-{\lambda}_{\tau}\left[\left(\frac{1+\beta \tau}{\beta}\right)\mathrm{ln}\left(1+\beta T\right)\right]}\end{array}$ (A.9)

From Equation (A.9), it can easily be noted that ${\lambda}_{\tau}$ has gamma distribution with parameters n and $\frac{1+\beta \tau}{\beta}\mathrm{ln}\left(1+\beta T\right)$ . Noting that gamma and Poisson distributions have a relationship defined as

$\frac{{b}^{a}}{\Gamma \left(a\right)}{\displaystyle \underset{0}{\overset{\lambda}{\int}}{x}^{a-1}{\text{e}}^{-bx}\text{d}x}=1-{\displaystyle \underset{h=0}{\overset{a-1}{\sum}}\frac{{\left(b\lambda \right)}^{h}}{h!}{\text{e}}^{-b\lambda}}$ . (A.10)

By substituting Equation (A.9) and Equation (A.10) into Equation (A.8), we obtain the first formula of Equation (12).

When $\beta $ is unknown, making transformation ${\lambda}_{\tau}=\alpha \beta /\left(1+\beta \tau \right)$ and $\beta =\beta $ , we obtain $\alpha ={\lambda}_{\tau}\frac{1+\beta \tau}{\beta}$ and $\beta =\beta $ . Note that the Jacobian is $\frac{\partial \left(\alpha ,\beta \right)}{\partial \left({\lambda}_{\tau},\beta \right)}=\frac{1+\beta \tau}{\beta}$ . From Equation (8), the joint posterior density of $\left({\lambda}_{\tau},\beta \right)$ is

$f\left({\lambda}_{\tau},\beta /{Y}_{obs}\right)=h\left(\alpha ,\beta /{Y}_{obs}\right)\left|\frac{\text{d}\left(\alpha ,\beta \right)}{\text{d}\left({\lambda}_{\tau},\beta \right)}\right|$ .

$\begin{array}{c}f\left({\lambda}_{\tau},\beta /{Y}_{obs}\right)={\left[\frac{{\lambda}_{\tau}\left(1+\beta \tau \right)}{\beta}\right]}^{n-1}\frac{{\beta}^{n-1}{\displaystyle \underset{i=1}{\overset{n}{\prod}}{\left(1+\beta {t}_{i}\right)}^{-1}}}{k\Gamma \left(n\right)}{\text{e}}^{-{\lambda}_{\tau}\frac{1+\beta \tau}{\beta}\mathrm{ln}\left(1+\beta T\right)}\cdot \frac{1+\beta \tau}{\beta}\\ =\frac{{\beta}^{n-1}{\displaystyle \underset{i=1}{\overset{n}{\prod}}{\left(1+\beta {t}_{i}\right)}^{-1}}}{k\Gamma \left(n\right){\left[\mathrm{ln}\left(1+\beta T\right)\right]}^{n}}{\left[\frac{1+\beta \tau}{\beta}\mathrm{ln}\left(1+\beta T\right)\right]}^{n}{\lambda}_{\tau}^{n-1}{\text{e}}^{-{\lambda}_{\tau}\frac{1+\beta \tau}{\beta}\mathrm{ln}\left(1+\beta T\right)}\end{array}$ (A.11)

By substituting Equation (A.10) and Equation (A.11) into Equation (A.8), we obtain the second formula of Equation (12). $\square $

Proof of preposition 3

For given level $\gamma $ , the time required to attain the target value ${\lambda}_{tv}$ is ${\tau}^{\ast}=\tau -T$ , where $\tau $ satisfies Equation (44). When $\beta $ is known, from Equation (46), it can easily be seen that

$2\left[\frac{1+\beta \tau}{\beta}\mathrm{ln}\left(1+\beta T\right)\right]{\lambda}_{\tau}$

follows a chi-square distribution with 2n degrees of freedom. Thus we have

$2\left[\frac{1+\beta \tau}{\beta}\mathrm{ln}\left(1+\beta T\right)\right]{\lambda}_{tv}={\chi}^{2}\left(2n,\gamma \right)$ . (A.12)

and Equation (13) follows immediately.

The time required to attain the target ${\lambda}_{tv}$ with level $\gamma $ when $\beta $ is unknown is ${\tau}^{*}=\tau -T$ where $\tau $ is the solution to

$\gamma =1-\frac{1}{k}{\displaystyle \underset{h=0}{\overset{n-1}{\sum}}{\displaystyle \underset{0}{\overset{\infty}{\int}}\frac{{\left[{\lambda}_{\tau}{\scriptscriptstyle \frac{1+\beta \tau}{\beta}}\mathrm{ln}\left(1+\beta T\right)\right]}^{h}}{h!}{\text{e}}^{-{\lambda}_{\tau}\frac{1+\beta \tau}{\beta}\mathrm{ln}\left(1+\beta T\right)}\cdot \frac{{\beta}^{n-1}{\displaystyle \underset{i=1}{\overset{n}{\prod}}{\left(1+\beta {t}_{i}\right)}^{-1}}}{{\left[\mathrm{ln}\left(1+\beta T\right)\right]}^{n}}\text{d}\beta}}$ . (A.13). $\square $

Proof of preposition 4

For a pre-determined $\tau \left(\tau >T\right)$ , the Bayesian upper prediction limit for ${\lambda}_{\tau}=\frac{\alpha \beta}{1+\beta \tau}$ with level $\gamma $ is ${\lambda}_{U}^{\left(\beta \right)}\left(\tau \right)$ satisfying $\gamma =\mathrm{Pr}\left\{{\lambda}_{\tau}\le {\lambda}_{U}^{\left(\beta \right)}\left(\tau \right)/{Y}_{obs}\right\}$ . From Equation (A.8) and Equation (A.12), we have ${\lambda}_{U}^{\left(\beta \right)}\left(\tau \right)=\frac{\beta {\chi}^{2}\left(2n;\gamma \right)}{2\left(1+\beta \tau \right)\mathrm{ln}\left(1+\beta T\right)}$ , thus follows Equation (15). The second part follows similarly. $\square $