IDEAS home Printed from https://ideas.repec.org/h/spr/ssrchp/978-0-85729-215-5_8.html
   My bibliography  Save this book chapter

Filtering and M-ary Detection in a Minimal Repair Maintenance Model

In: Replacement Models with Minimal Repair

Author

Listed:
  • Lakhdar Aggoun

    (Sultan Qaboos University)

  • Lotfi Tadj

    (Saint Mary’s University
    Dalhousie University)

Abstract

An age-dependent repair model is considered in this paper. The notion of the “age” of the product and the degree of repair are used to define the virtual age of the product. Two problems are considered in this paper. In the first problem, the degree of repair is a stochastic process and is allowed to switch between a finite number of values due to various phenomena. Switching is assumed to happen according to the jumps of a homogeneous, finite-state Markov chain. We use hidden Markov models (HMM) to develop a recursion to estimate the conditional probability distribution of the degree of repair process. We also use the Expectation-maximization (EM) algorithm to update optimally the probability transitions of this process. In the second problem, the degree of repair is a random variable and belongs to a set of hypotheses hypothesis. At each epoch $$n,$$ a list of $$M$$ candidate models is available and the optimal one is chosen.

Suggested Citation

  • Lakhdar Aggoun & Lotfi Tadj, 2011. "Filtering and M-ary Detection in a Minimal Repair Maintenance Model," Springer Series in Reliability Engineering, in: Lotfi Tadj & M.-Salah Ouali & Soumaya Yacout & Daoud Ait-Kadi (ed.), Replacement Models with Minimal Repair, pages 207-221, Springer.
  • Handle: RePEc:spr:ssrchp:978-0-85729-215-5_8
    DOI: 10.1007/978-0-85729-215-5_8
    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.

    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-0-85729-215-5_8. 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.