Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Reliability Computation of Moranda's Geometric Software Reliability Model

Reliability Computation of Moranda's Geometric Software Reliability Model Abstract 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 P n ( t ), the intensity function and the reliability R τ ( t ). In the proposed procedure P n ( t ) is the sum of ( n +1) terms and each term is based on a factor, which can be from the above mentioned table. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Economic Quality Control de Gruyter

Reliability Computation of Moranda's Geometric Software Reliability Model

Economic Quality Control , Volume 22 (2) – Oct 1, 2007

Loading next page...
 
/lp/de-gruyter/reliability-computation-of-moranda-s-geometric-software-reliability-i2fySmwGLw
Publisher
de Gruyter
Copyright
Copyright © 2007 by the
ISSN
1869-6147
eISSN
1869-6147
DOI
10.1515/EQC.2007.261
Publisher site
See Article on Publisher Site

Abstract

Abstract 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 P n ( t ), the intensity function and the reliability R τ ( t ). In the proposed procedure P n ( t ) is the sum of ( n +1) terms and each term is based on a factor, which can be from the above mentioned table.

Journal

Economic Quality Controlde Gruyter

Published: Oct 1, 2007

There are no references for this article.