A kind of parallel algorithm based on tabular iteration for fault diagnosis

Firstly, a fault diagnosis approach of a large system based on iteration of the function space in dynamic programming is proposed, and a new concept concerning the minimum coefficient product of routes from source node to target node is put forward. An algorithm to calculate this minimum and to track down this correspondent route is given. Secondly, the algorithm is changed into a tabular iteration method, which is simpler, more regular and helpful for programming. Thirdly, the algorithm's operation time is discussed. In order to reduce the operation time, a concept of bipartite state space is brought up. According to this concept, a large net can be divided into two or more subnets which are independent of each other. Fourthly, a kind of parallel algorithm based on tabular iteration for fault diagnosis is offered and the steps of applying this algorithm are detailed. Finally, this approach is shown to be more effective and simpler by an example of fault diagnosis.