Skip to main content
SpringerLink
Log in

Symbolic reliability evaluation of a software with network structure

  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

This paper proposes a graph theoretic approach for enumeration of paths and symbolic reliability expression of a large software from the program graph having a series, parallel or complex network structure. It also presents a brief account of the factors which influence the overall reliability of a software. One space application program has been used for illustration purpose.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Musa, J.D.; Iannino, A. and Okumoto, K.; “Software Reliability Measurement, Prediction, Application”, McGraw-Hill Int. Ed., 1987.

  2. Shooman, M.L.; “Software Engineering: Design, Reliability and Management”, McGraw Hill International Ed., 1983.

  3. Schneidewind, N.F.; “Application of Program Graphs and Complexity Analysis to Software Development and Testing”, IEEE Trans. On Rel., vol. R-28, 1979, pp.192–198.

    Article  Google Scholar 

  4. Fischer, K.F. and Walker, M.G.; “Improved Software Reliability Through Requirements Verifications”, IEEE Trans. On Rel., vol. R-28, 1979, pp. 233–240.

    Article  Google Scholar 

  5. Suri, P.K. and Aggarwal, K.K.; “Reliability Evaluation of Computer Programs”, Microelectron. Rel., 20, 1980, pp. 465–470.

    Article  Google Scholar 

  6. Suri, P.K. and Aggarwal K.K.; “Software Reliability of Programs with Network Structure”, Microelectron. Rel., 21, 1981, pp. 203–207.

    Article  Google Scholar 

  7. Leveson, N.G. and Stolzy, J.L.; “Safety Analysis of Ada Programs Using Fault Trees”, IEEE Trans. On Rel., vol. R-32, 1983, pp. 479–484.

    Article  Google Scholar 

  8. Aziz, M.A.; Sobhan, M.A. and Samad, M.A.; “Reduction of Computations In Enumeration of Terminal and Multiterminal Path Sets by the Method of Indexing”, Microelectron. Rel., 32, 1992, pp. 1067–1072.

    Article  Google Scholar 

  9. Misra, R.B. and Misra, K. B.; “Enumeration of all Simple Paths In a Communication Network”, Microelectron. Rel., 20, 1980, pp. 419–426.

    Article  Google Scholar 

  10. Samad, MA; “An Efficient Algorithm for Simultaneously Deducing Minimal Paths as well as Cuts of a Communication Network”, Microelectron. Rel., 27, 1987, pp. 437–441.

    Article  Google Scholar 

  11. Samad, M.A.; “An Efficient Method for Terminal and Multiterminal Path Set Enumeration”, Microelectron. Rel., 27, 1987, pp. 443–446.

    Article  Google Scholar 

  12. Abraham, J.A.; “An Improved Algorithm for Network Reliability”, IEEE Trans. On Rel., vol. R-28, 1979, pp. 58–61.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Maths., Sikkim Manipal Institute of Technology, 737132, Majitar, India

    S. Chatterjee

  2. Reliability Eng. Centre, Indian Institute of Technology, 721 302, Kharagpur, India

    R. B. Misra

  3. Dept. of Maths., Indian Institute of Technology, 721 302, Kharagpur, India

    S. S. Alam

Authors
  1. S. Chatterjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. B. Misra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. S. Alam
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chatterjee, S., Misra, R.B. & Alam, S.S. Symbolic reliability evaluation of a software with network structure. OPSEARCH 41, 165–177 (2004). https://doi.org/10.1007/BF03398842

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03398842

Search

Navigation