IDEAS home Printed from https://ideas.repec.org/h/spr/ssrchp/978-3-031-05347-4_17.html
   My bibliography  Save this book chapter

An Effort Allocation Model for a Three Stage Software Reliability Growth Model

In: Predictive Analytics in System Reliability

Author

Listed:
  • Sujit Kumar Pradhan

    (BITS Pilani-KK Birla Goa Campus)

  • Anil Kumar

    (BITS Pilani-KK Birla Goa Campus)

  • Vijay Kumar

    (Amity Institute of Applied Sciences, Amity University Uttar Pradesh)

Abstract

This chapter investigates the optimal efforts allocation plan to minimize the total cost during the testing phase of the software development life cycle using three stages fault detection, isolation, and removal under a dynamic environment. We have used three-stage modelling to allocate resources, which incorporates different efforts, i.e. detection effort, isolation effort, and removal effort. We have used the optimal control-theoretic approach to find the optimal policies by considering effort as a control parameter. We also discussed the variations in the future cost of the model by assuming that the cost of detection, isolation and removal follows the learning curve phenomenon. The theoretical results and optimal control theory-based optimized policy is supported by a numerical example.

Suggested Citation

  • Sujit Kumar Pradhan & Anil Kumar & Vijay Kumar, 2023. "An Effort Allocation Model for a Three Stage Software Reliability Growth Model," Springer Series in Reliability Engineering, in: Vijay Kumar & Hoang Pham (ed.), Predictive Analytics in System Reliability, pages 263-282, Springer.
    • Handle: RePEc:spr:ssrchp:978-3-031-05347-4_17
    DOI: 10.1007/978-3-031-05347-4_17
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:ssrchp:978-3-031-05347-4_17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.