# Patent

## Title
Diagnosis of equipment failures using an integrated approach of case based reasoning and reliability analysis

## Abstract

Equipment failures are diagnosed using an integrated approach of case-based reasoning (CBR) and statistical reliability analysis. The method outputs a single list of suggested failed components, ranked by an overall probability of failure, and their associated past solutions from the case base. The overall probability of failure is calculated using the combined logic of case based reasoning and statistical reliability analysis. The method is typically used in a real-time decision support system to aid equipment diagnosis by a maintenance technician working in the field.

## Background
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to decision support software in diagnosing equipment failures, such as the cases when production equipment fails unexpectedly. This invention provides a method to be used in a computational engine to help the user pinpoint the failed component in a complex machine with a large number of components.
2. Background Description
Consider the situation when a piece of equipment, such as a machine on the production shop floor, has failed. An immediate task is to diagnose the failure to determine what needs to be done to bring the equipment back to a running state. In particular, the failed component(s), among the possibly large number of candidates, have to be identified and then repaired or replaced. We focus on the first step: diagnosis where the failed component(s) is identified. When the equipment is relatively simple (such as a household appliance) or when the repair technician is highly skilled and experienced, this diagnosis is usually straightforward and quick. When the equipment is complex with many failure modes (such as computer-controlled production equipment, aircraft, or large scale computing equipment), and/or when the repair technician is less experienced (such as the case in many industries where labor turnover is high), the diagnosis task may take considerable time. Further, failures may often be diagnosed incorrectly, resulting in wasted time and resources of replacing a working part and another iteration of diagnosis-repair. On the other hand, in many industries (e.g., semiconductor manufacturing, airlines, critical data centers) unexpected down time of equipment can be very costly.
SUMMARY OF THE INVENTION
It is therefore an object of this invention to provide a method to be used in a computational engine for real-time decision support to a repair technician.
This invention provides a method to be used in a computational engine for real-time decision support to the repair technician. It gives a list of suggested failed components in the equipment, ordered by decreasing probability of failure, based on historical failure data (of that particular machine or other more general data) and the symptom of the failure at hand input by the technician. It helps the technician quickly focus on a few highly probable failed components and therefore reduces the diagnosis time. It also improves the probability that the failed component(s) is correctly identified, reducing the need for further repair or a subsequent failure due to the same, unfixed problem.
The diagnosis method of this invention integrates two distinct approaches: case based reasoning (CBR) from the computer science discipline and reliability analysis from the industrial statistics discipline. The integrated approach provides a single, consistent mathematical framework in which these two distinct approaches interact and contribute. The invention provides a single, consistent list of output (suggested failed components), taking advantage of the merits of both approaches.
Case based reasoning (CBR) is an approach to build a knowledge-based system to help solve a problem by using past solutions to similar problems encountered. A basic introduction to this approach is contained in I. Watson, Applying Case-Based Reasoning: Techniques for Enterprise Systems, Morgan Kaufmann Publishers, San Francisco (1997). The approach has been successfully used in practice in a range of applications, such as production machine loading (D. Hennessy and D. Hinkle, “Applying case-based reasoning to autoclave loading”, IEEE Expert, October 1992, pp. 21-26), customer service help desks (ibid., Watson 1997, Chapter 5), online catalog sales (I. Vollrath, W. Wilke and R. Bergman, “Case-based reasoning support for online catalog sales”, IEEE Internet Computing, July/August 1998, pp. 47-54). In particular, CBR has been used in equipment diagnostics, such as aircraft troubleshooting (R. V. Magaldi, “CBR for troubleshooting aircraft on the flight line”, Proceedings of the IEEE Colloquium on Case-Based Reasoning: Prospects for Applications, Digest No. 1994/057, pp. 6/1-6/9), or consumer product problem diagnosis (U.S. Pat. No. 6,571,236 to K. M. Ruppelt for “Method and Apparatus for Problem Diagnosis and Solution”, issued May 2003). It has also been combined with other artificial intelligence techniques to perform diagnostics (e.g., L. Portinale and P. Torasso, “ADAPtER, An Integrated Diagnostic System Combining Case-Based and Abductive Reasoning”, Proc. First International Conference on Case-Based Reasoning-ICCBR 95, Sesimbra, Lecture Notes in Artificial Intelligence 1010, pp. 277-288). A number of CBR engines are commercially available, such as Kaidara Advisor from Kaidara Software Inc., ReCall from ISoft, k-Commerce from Inference Corp., Case Advisor from Sentenitia Software Inc., ReMind from Cognitive Systems Inc., CPR++ from Haley Enterprises.
From a practical point of view, the advantages of CBR are as follows.

    1. The basic approach of CBR is rooted in psychology and is strongly inspired by how humans solve problems. The approach therefore appears natural, easily understood, and readily accepted by the user.
    2. It makes use of solutions that were used successfully in the past, taking advantage of the know-how of a group of people (e.g., the entire equipment maintenance organization within a business).
    3. Compared to other approaches to a rule-based expert system, a CBR system requires much less maintenance effort over time and yet still makes use of the latest data sent to the system.


Statistical reliability analysis is a well-established area in the field of industrial statistics (see, e.g., R. E. Barlow, Engineering Reliability, Society for Industrial and Applied Mathematics and American Statistical Association, 1998). It provides a set of mathematical techniques to perform quantitative analysis of the reliability of an engineering system (such as a machine) built from a set of components. A number of software packages are commercially available to perform such analysis, such as FRACAS from Relex, suite of software packages from ReliaSoft, RAM Commander from SoHar, QuART from Quanterion Solutions, modules in general purpose statistical packages such as SAS from SAS Institute or S-plus from Insightful Corp.
From a practical point of view, the advantages of reliability analysis are as follows:

    1. It provides a set of techniques to compute quantitative measures of reliability (e.g., probability of failure of a component or a system) from a set of historical failure data collected over time. These numbers provide insight to solving the maintenance problem at hand (i.e., diagnosing failures). Clear-cut ranking is possible with such measures.
    2. The quantitative measures provide an opportunity for further analysis, such as maintenance optimization or failure prediction.
    3. Depending on the level of detail of the historical data, reliability measures can be computed at the component level and then used to predict the reliability of a new system using a set of known components.
    4. Some of the commonly used reliability measures (e.g., mean time to failure) are published for standard components (e.g., standard electronic parts) or are available from their vendors. These published figures can be used as a reference or as a starting point for analyzing a specific system at hand.


Other forms of reliability analysis have been used in the context of a knowledge-based system for equipment diagnosis. D. L. Iverson and F. A. Patterson-Hine in U.S. Pat. No. 5,581,694 for “Method of Testing and Predicting Failures of Electronic Mechanical Systems” issued December 1996 applied digraph models in a knowledge-based system to analyze and predict failures of an electronic system, such as a flight control system on board a space station. The digraph method associates the failure of a component with a failure event which can be observed. Given a knowledge base of digraph models of systems, the system calculates the one or two components that have caused the failure events.
Therefore, according to the invention, there is provided a method to diagnose an equipment failure using an integrated approach of case based reasoning and reliability analysis. This method uses historical failure data recorded in maintenance transaction management systems and other relevant data such as expected lifetimes of components or machines published by the equipment vendor, or publicly available failure data of standard components (such as standard electronic components), and the symptom of the failure at hand input by the user. The method produces as output a list of suggested failed components in the equipment, ordered by decreasing probability of failure. When the method is implemented in a real-time equipment diagnostic decision support system, it helps the user quickly focus on a few highly probable failed components and therefore reduces the diagnosis time. It also improves the probability that the failed component(s) is correctly identified, reducing the need for further repair or a subsequent failure due to the same, unfixed problem. Because this method integrates two different approaches, it possesses the unique combination of the advantages of both approaches (as discussed above), and yet provides a single, consistent output to the user.



BRIEF DESCRIPTION OF THE DRAWINGS
The foregoing and other objects, aspects and advantages will be better understood from the following detailed description of a preferred embodiment of the invention with reference to the drawings, in which:
FIG. 1 is a block diagram of the architecture of a real-time decision support system for equipment diagnosis according to the invention;
FIG. 2 is a flow diagram showing the high level logic of the method according to the invention; and
FIG. 3 is an illustration of the machine hierarchy in the case base.



DETAILED DESCRIPTION OF A PREFERRED EMBODIMENT OF THE INVENTION
In the situation when a piece of equipment, such as a machine on the production shop floor, has failed, the immediate goal is to diagnose the failure to determine what needs to be done to bring the equipment back to a running state. To this end we propose a decision support system to help the maintenance technician perform the equipment diagnosis.
FIG. 1 shows a typical architecture of such a decision support system (DSS) for equipment diagnosis. Referring to the figure, we describe the decision support system in detail. The DSS client 10 is the user interface to the DSS server 12 through which the maintenance technician interacts with the system. The key inputs to the system, entered by the technician, are the identification of the machine or machine-process combination, a problem description in free form text, or as a selection out of a list of common problem descriptions, or a combination of both. The DSS client 10 will also display the results of the system computation to the technician.
The DSS server 12 includes a client interface 121, which provides the interface to a real-time support engine 122 and a case base update processor 123, and a database interface 124 through which the real-time support engine 122 and the case base update processor access data. The DSS database interface 124 handles all read/write operations performed by the system to its own database 14 (DSS database) and the external database 16 (maintenance management system database). The maintenance management system database 16 is external to the system and is provided by any of the commercial maintenance management systems available. The maintenance management system database 16 contains a detailed transaction record of each machine failure.
The DSS database 14 contains all necessary information for DSS computation to occur. Some of this information is obtained from the maintenance management system database 16, through the execution of the case base update processor 123. The case base update processor 123 reads transaction records from the maintenance management system database 16 after the transactions are closed, and then updates the case base accordingly by extracting the information required by the case base (see characterization of each record of the case base below). The case base is the primary input to the case based reasoning portion of the DSS. Each record of the case base is characterized by:

    
    
        X0=the identification of the machine or machine-process combination if the machine is capable of more than one process,
        Xi=1, if component i failed; 0 otherwise; i=1, . . . , N, where N is the number of components in the machine, and
        XN+1=a description of the problem as seen by the maintenance technician, where the description can be of free-form text as entered by the technician, or one of a number of standard description provided by the maintenance management system, or a combination of both.
    
    


The real-time decision support engine122 contains the execution logic of the proposed method, as shown in FIG. 2. It is an implementation of the key part of this invention. The decision support computation is real time because it is performed after the technician enters all the relevant information into the system and it responds to the technician interactively in input block 21. We describe the execution logic as follows.
Consider the set of records corresponding to X0=x and Xi=1 where i=k, Xi=0 where i≠k, i.e., all records corresponding to component k failures for machine x. Let T be the number of records in this collection, corresponding to the number of failures encountered in the past. The problem description in each record in this collection are different, as they were entered in different occasions or by different technicians, and/or component k can fail for different reasons with different symptoms. Hence, there is a cluster of records corresponding to component k failures for machine x, denoted by cluster yk and characterized by the vector (X0=x, Xi=1 where i=k, Xi=0 where i≠k, XN+1=xN+1,t)t=1, . . . , T. (Within this cluster, there may be sub-clusters corresponding to the different failure modes and hence the fundamentally different problem descriptions.) This concept of clusters has been used in a different context related to case based reasoning in H. Tirri, P. Kontkanen and P. Myllymaki, “A Bayesian framework for case-based reasoning”, Proceedings of the 3rd European Workshop on Case-Based Reasoning, Lausanne, Switzerland, November 1996.
Let P {S} denote the probability of the occurrence of event S. For the failure at hand, the technician enters a machine identification X0=x and a problem description XN+1=d. Our objective to diagnose the failure can be stated as: Given X0=x and XN+1=d, find k* such that




  
    
      
        
          k
          *
        
        =
        
          
            
              arg
              ⁢
              
                
              
              ⁢
              max
            
            k
          
          ⁢
          
            
          
          ⁢
          P
          ⁢
          
            {
            
              
                
                  X
                  0
                
                =
                x
              
              ,
              
                
                  X
                  i
                
                =
                
                  {
                  
                    
                      
                        
                          
                            1
                            ,
                          
                        
                        
                          
                            i
                            =
                            k
                          
                        
                      
                      
                        
                          
                            0
                            ,
                          
                        
                        
                          
                            i
                            ≠
                            k
                          
                        
                      
                    
                    ,
                    
                      
                        X
                        
                          N
                          +
                          1
                        
                      
                      =
                      d
                    
                  
                  }
                
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




where the maximum is taken over k=1, . . . , N. That is, we want to find k* such that component k* has the highest probability of having a failure, given all the available information. Let Y denote the clustering variable as discussed above. It follows that





  
    
      
        P
        ⁢
        
          {
          
            
              
                X
                0
              
              =
              x
            
            ,
            
              
                X
                i
              
              =
              
                
                  {
                  
                    
                      
                        
                          
                            1
                            ,
                          
                        
                        
                          
                            i
                            =
                            k
                          
                        
                      
                      
                        
                          
                            0
                            ,
                          
                        
                        
                          
                            i
                            ≠
                            k
                          
                        
                      
                    
                    ,
                    
                      
                        X
                        
                          N
                          +
                          1
                        
                      
                      =
                      d
                    
                  
                  }
                
                =
                
                  
                    ∑
                    
                      k
                      =
                      1
                    
                    N
                  
                  ⁢
                  
                    P
                    ⁢
                    
                      {
                      
                        Y
                        =
                        
                          y
                          k
                        
                      
                      }
                    
                    ⁢
                    
                      
                    
                    ⁢
                    P
                    ⁢
                    
                      {
                      
                        
                          
                            X
                            0
                          
                          =
                          x
                        
                        ,
                        
                          
                            X
                            i
                          
                          =
                          
                            {
                            
                              
                                
                                  
                                    
                                      1
                                      ,
                                    
                                  
                                  
                                    
                                      i
                                      =
                                      k
                                    
                                  
                                
                                
                                  
                                    
                                      0
                                      ,
                                    
                                  
                                  
                                    
                                      i
                                      ≠
                                      k
                                    
                                  
                                
                              
                              ,
                              
                                
                                  X
                                  
                                    N
                                    +
                                    1
                                  
                                
                                =
                                
                                  
                                    d
                                    |
                                    Y
                                  
                                  =
                                  
                                    y
                                    k
                                  
                                
                              
                            
                            }
                          
                        
                      
                    
                  
                
              
            
          
        
      
    
    
      
        (
        2
        )
      
    
  




We calculate each of the two probabilities in the summand of equation (2), corresponding to the steps of function blocks 22 and 23 in FIG. 2. First, P{Y=Yk} is the probability that component k fails, given that the machine fails, by the definition of our cluster.





  
    
      
        
          
            
              P
              ⁢
              
                {
                
                  Y
                  =
                  
                  ⁢
                  
                    y
                    k
                  
                
                }
              
            
          
        
        
          
            
              =
              
              ⁢
              P
              ⁢
              
                {
                
                  
                    component
                    ⁢
                    
                      
                    
                    ⁢
                    k
                    ⁢
                    
                      
                    
                    ⁢
                    fails
                  
                  |
                  
                    machine
                    ⁢
                    
                      
                    
                    ⁢
                    fails
                  
                
                }
              
            
          
        
        
          
            
              =
              
              ⁢
              
                P
                ⁢
                
                  
                
                ⁢
                
                  
                    {
                    
                      component
                      ⁢
                      
                        
                      
                      ⁢
                      k
                      ⁢
                      
                        
                      
                      ⁢
                      fails
                    
                    }
                  
                  /
                  P
                
                ⁢
                
                  
                
                ⁢
                
                  {
                  
                    machine
                    ⁢
                    
                      
                    
                    ⁢
                    fails
                  
                  }
                
              
            
          
        
        
          
            
              
                =
                
                ⁢
                
                  
                    [
                    
                      
                        E
                        ⁡
                        
                          (
                          
                            D
                            k
                          
                          )
                        
                      
                      
                        
                          E
                          ⁡
                          
                            (
                            
                              D
                              k
                            
                            )
                          
                        
                        +
                        
                          E
                          ⁡
                          
                            (
                            
                              U
                              k
                            
                            )
                          
                        
                      
                    
                    ]
                  
                  
                    [
                    
                      
                        E
                        ⁡
                        
                          (
                          D
                          )
                        
                      
                      
                        
                          E
                          ⁡
                          
                            (
                            D
                            )
                          
                        
                        +
                        
                          E
                          ⁡
                          
                            (
                            U
                            )
                          
                        
                      
                    
                    ]
                  
                
              
              ,
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




where

    
    
        E(Dk) is the expected time to repair for component k,
        E(Uk) is the expected time between two successive failures for component k (minus the down time),
        E(D) is the expected time to repair for the machine, and
        E(U) is the expected time between two successive failures for the machine (minus the down time).
    
    


The last equality is a well-known result in reliability theory which is remarkably general. (See, e.g., ibid. Barlow, Chapter 8.) To estimate each of these quantities, one of the following ways can be used. We will use E(U) for our discussion and the other quantities follow exactly.

    1. Estimate E(U) from the simple average of the times between two successive failures recorded in the maintenance transaction records. When we have a fairly long history of the equipment, this approach provides a good estimate for the particular machines we own.
    2. Obtain estimates of E(U) from published data from the equipment vendor or from the open literature where available. The latter case applies to standard electronic components for example. This has the advantage in cases where the equipment is new and its history is short or non-existent.
    3. Combine (1) and (2) above so that the advantages of both approaches can be realized. A simple but effective way is to use exponential smoothing as follows. Let n=0, 1, 2, . . . be the number of times the machine has failed and un be the estimate of E(U) at time n. Then u0=estimate from equipment vendor or open literature, un=λun−1+(1−λ) (time between failure n and failure n−1), n>0, where 0≦λ≦1 is a user specified parameter. To facilitate computation, n can be kept in a field of the case base, whose value will be computed during case base update time by the case base update processor.


Now we turn to the second probability in the summand of equation (2),




  P
  ⁢
  
    {
    
      
        
          X
          0
        
        =
        x
      
      ,
      
        
          X
          i
        
        =
        
          {
          
            
              
                
                  
                    1
                    ,
                  
                
                
                  
                    i
                    =
                    k
                  
                
              
              
                
                  
                    0
                    ,
                  
                
                
                  
                    i
                    ≠
                    k
                  
                
              
            
            ,
            
              
                X
                
                  N
                  +
                  1
                
              
              =
              
                
                  d
                  |
                  Y
                
                =
                
                  y
                  k
                
              
            
          
          }
        
      
      ,
    
  




which is step 3 in function block 24 in FIG. 2. We use the case based reasoning approach to estimate this quantity. Recall that each record in our case base is characterized by (X0, X1, . . . , XN, XN+1). X0 (machine/process identification) and XN+1 (problem description) are the two key attributes used in matching an incoming case to a historical case stored in the case base. To facilitate finding the most relevant cases, the machines represented in the case base are organized into a hierarchical structure, the concept of which is shown in FIG. 3.

Referring to FIG. 3, all machines are divided into machine styles, which in turn are divided into machine sub-styles, in turn into machine-processes, then into four levels of components. A machine sub-style can be a machine running a set of processes, or a set of machines running the same process. The exact definition and the number of levels of machine styles/sub-styles and components will depend on the specific implementation, based on whether failures are more dependent on machines or processes.
To match X0 and XN+1, we use the following logic to retrieve the most relevant cases as much as possible. Using the same notation, let x0 be the machine-process identification and d be the problem description of the incoming case.

    
    
        Step 1: Find the set of records R with an exact match to x0 at the machine-process level in the machine hierarchy of the case base.
        Step 2: If step 1 is unsuccessful, find the set of records R whose machine or process matches exactly to x0 at one level above the level just searched. Repeat this step until successful.
        Step 3: In the set R, find a subset R′ of records with the distance of XN+1 to d within a specified value. Rank the records within this subset R′ using the same distance measure. The distance measure can be defined as the degree of an approximate or fuzzy match between the given text d and the value of XN+1 in the record. The tools of the text analysis trade can be applied here. For example, general techniques in string and text search or matching are described in S. S. Skiena, The Algorithm Design Manual, Springer-Verlag, New York (1997), and G. Salton, Automatic Text Processing, Addison-Wesley, New York (1988). More advanced techniques in document retrieval from a database of text documents based on the user input of a word or phrase can also be used (e.g., U.S. Pat. No. 5,761,497 to Holt et al. for “Associative Text Search and Retrieval System that Calculates Ranking Scores and Window Scores”, issued June 1998), by treating the problem description field XN+1 as the body of a text document. Many of the commercial case-based reasoning systems mentioned above provide some form of text matching.

Then,

    
    






  
    
      
        P
        ⁢
        
          {
          
            
              
                X
                0
              
              =
              x
            
            ,
            
              
                X
                i
              
              =
              
                
                  {
                  
                    
                      
                        
                          
                            1
                            ,
                          
                        
                        
                          
                            i
                            =
                            k
                          
                        
                      
                      
                        
                          
                            0
                            ,
                          
                        
                        
                          
                            i
                            ≠
                            k
                          
                        
                      
                    
                    ,
                    
                      
                        X
                        
                          N
                          +
                          1
                        
                      
                      =
                      
                        
                          d
                          |
                          Y
                        
                        =
                        
                          y
                          k
                        
                      
                    
                  
                  }
                
                =
                
                  
                    (
                    
                      Number
                      ⁢
                      
                        
                      
                      ⁢
                      of
                      ⁢
                      
                        
                      
                      ⁢
                      records
                      ⁢
                      
                        
                      
                      ⁢
                      in
                      ⁢
                      
                        
                      
                      ⁢
                      the
                      ⁢
                      
                        
                      
                      ⁢
                      set
                      ⁢
                      
                        
                      
                      ⁢
                      
                        (
                        
                          
                            R
                            ′
                          
                          ⋂
                          
                            cluster
                            ⁢
                            
                              
                            
                            ⁢
                            
                              y
                              k
                            
                          
                        
                        )
                      
                    
                    )
                  
                  
                    (
                    
                      Total
                      ⁢
                      
                        
                      
                      ⁢
                      number
                      ⁢
                      
                        
                      
                      ⁢
                      of
                      ⁢
                      
                        
                      
                      ⁢
                      records
                      ⁢
                      
                        
                      
                      ⁢
                      in
                      ⁢
                      
                        
                      
                      ⁢
                      cluster
                      ⁢
                      
                        
                      
                      ⁢
                      
                        y
                        k
                      
                    
                    )
                  
                
              
            
          
        
      
    
    
      
        (
        4
        )
      
    
  




The total number of records in cluster yk is simply the total number of records corresponding to failure of component k. This quantity can be pre-computed for the case base and updated only when the case base is updated with new records. To facilitate computing the set (R′∩ cluster yk), at case base update time, each record can be given an index field to indicate what component failure it belongs to, by the case base update processor.
When the case base is small (e.g., when the equipment is new), the total number of records in some clusters may be zero. In these cases, there are not enough historical data to estimate the probability




  P
  ⁢
  
    {
    
      
        
          X
          0
        
        =
        x
      
      ,
      
        
          X
          i
        
        =
        
          {
          
            
              
                
                  
                    1
                    ,
                  
                
                
                  
                    i
                    =
                    k
                  
                
              
              
                
                  
                    0
                    ,
                  
                
                
                  
                    i
                    ≠
                    k
                  
                
              
            
            ,
            
              
                X
                
                  N
                  +
                  1
                
              
              =
              
                
                  d
                  |
                  Y
                
                =
                
                  y
                  k
                
              
            
          
          }
        
      
      ,
    
  




given a user-specified problem description d. A conservative strategy is to set this probability to one, so that the total probability of the failure belonging to cluster k (the summand for each k in equation (2)) is the probability estimated by reliability analysis, regardless of the specified problem description.

The overall failure probability for each component, equation (2), can then be solved by substituting equations (3) and (4) into equation (2) for each k=1, 2, . . . , N. This is step 4 in function block 25 of FIG. 2. Our objective, equation (1), can be solved by searching for the maximum probability over k=1, 2, . . . , N. In practice, we want to not only find the maximum, but also provide the user a list of top ranked components by their estimated probability of failure. This list can be obtained by simply including all components whose probability of failure is above a certain user-specified value and ranking them according to the calculated failure probabilities. For each component, the relevant past solutions retrieved from the case base can also be presented at the same time. This is the key output of the invention. This completes step 5 in function block 26 of FIG. 2. The output 27 is a list of failed components with their corresponding past solutions, ranked by failure probabilities.
A straightforward extension of this method can be used to handle situations where the user specified not just the machine, but also a component at some level in the machine hierarchy, i.e., X0 is specified at some component level. This might be the case when the technician has determined from his experience that a certain component or sub-assembly within the machine is at fault and wants to investigate within that component only. The same method described above applies, except that it now works at the specified component level, i.e., the description of the above method applies with the word “machine” replaced by “component” and all the straightforward changes following that.
While the invention has been described in terms of a single preferred embodiment, those skilled in the art will recognize that the invention can be practiced with modification within the spirit and scope of the appended claims.

## Claims

1. A method to diagnose equipment failures using an integrated approach of case-based reasoning and reliability analysis, comprising the steps of:
collecting a statistical reliability data for each of a plurality of given equipments and for each of the hardware components of said equipment, said collecting including calculating a statistical average time between two successive failures of the equipment, calculating a statistical average time between successive two failures for each of said hardware components, calculating a statistical average time to repair failures of the equipment and calculating a statistical average time to repair failures of each of its hardware components;
constructing a case base database for each of the equipment, wherein each case based database record comprises at least four fields, including a failed equipment identifier field, a failed component identifier field, a failure description text field, and a solution record field;
receiving an equipment problem description from a user, said description including a problem equipment identifier and a problem description text;
generating for each of said hardware components a conditional statistical probability of said component having a failed state given that the equipment identified by the user-input problem equipment identifier has a failed state, based on said collected statistical reliability data;
matching the problem description test input by the user to the failure description text field of the case base database records to calculate a case-based probability for each of said hardware components associated with said failed state;
generating a list of component troubleshooting recommendations based on said generated conditional statistical probabilities and said calculated case base probabilities; and
displaying said list of generated troubleshooting recommendations.

2. A decision support system to diagnose equipment failures using an integrated approach of case-based reasoning and reliability analysis, comprising:
a statistical reliability database storing a statistical reliability data representing, for each of a plurality of given equipments and for each of the hardware components of said equipment, a statistical average time between two successive failures of the equipment, the statistical average time between two successive failures for each of its hardware components, the statistical average time to repair failures of the equipment and the statistical average time to repair failures of each of its hardware components;
a case base maintenance management system database for the equipment wherein each case base database record comprises at least four fields, including a failed equipment identifier field, a failed component identifier field, a failure description text field, and a solution record field;
a decision support system database;
a decision support system client for receiving an equipment problem description from a user, said description including a problem equipment identifier and a problem description text;
a decision support system server receiving input from the decision support system client and accessing said case base maintenance management system database and said decision support system database, said decision support system server including
a real-time decision support system engine for calculating failure probability for each hardware component in the equipment, wherein said engine is
arranged to receive an equipment problem description from a user, said description including a problem equipment identifier data and a problem description text;
arranged to generate, for each of said hardware components a conditional statistical probability of said component having a failed state given that the equipment identified by the user-input problem equipment identifier has a failed state, based on said collected statistical reliability data;
arranged to match the problem description test input by the user to the failure description text field of the case base database records to calculate a case-based probability for each of said hardware components associated with said failed state;
arranged to generate a list of component troubleshooting recommendations based on said generated conditional statistical probabilities and said calculated case base probabilities, and
arranged to display said a list of component troubleshooting recommendations ranked by said generated conditional statistical probabilities and said calculated case base probabilities computed for each hardware component, and to retrieve corresponding past solutions from the case base maintenance management system database; and

a case base update processor for copying closed failure transaction records from the case base maintenance management systems database, and extracting information from these transaction records to obtain attributes required by said real-time decision support system engine, and indexing each closed failure transaction record by a failed component identification and a number of occurrence of failure of that particular component.