In this paper we propose an equation model of system-level fault diagnoses, and construct corresponding theory and algorithms. People can turn any PMC model on ex-test into an equivalent equation (or a system of equat...In this paper we propose an equation model of system-level fault diagnoses, and construct corresponding theory and algorithms. People can turn any PMC model on ex-test into an equivalent equation (or a system of equations), and find all consistent fault patterns based on the equation model. We can also find all fault patterns, in which the fault node numbers are less than or equal to t without supposing t-diagnosable. It is not impossible for all graphic models.展开更多
With the popularization of network applications and multiprocessor systems, dependability of systems has drawn considerable attention. This paper presents a new technique of node grouping for system-level fault diagno...With the popularization of network applications and multiprocessor systems, dependability of systems has drawn considerable attention. This paper presents a new technique of node grouping for system-level fault diagnosis to simplify the complexity of large system di-agnosis. The technique transforms a complicated system to a group network, where each group may consist of many nodes that are either fault-free or faulty. It is proven that the transformation leads to a unique group network to ease system diagnosis. Then it studies systematically one-step t-faults diagnosis problem based on node grouping by means of the concept of hide-pendent point sets and gives a simple sufficient and necessary condition. The paper presents a diagnosis procedure for t-diagnosable systems. Furthermore, an efficient probabilistic diagnosis algorithm for practical applications is proposed based on the belief that most of the nodes in a system are fault-free. The result of software simulation shows that the probabilistic diagnosis provides high probability of correct diagnosis and low diagnosis cost, and is suitable for systems of any kind of topology.展开更多
基金Project supported by the National Natural Science Foundation of China! (No.69973016).
文摘In this paper we propose an equation model of system-level fault diagnoses, and construct corresponding theory and algorithms. People can turn any PMC model on ex-test into an equivalent equation (or a system of equations), and find all consistent fault patterns based on the equation model. We can also find all fault patterns, in which the fault node numbers are less than or equal to t without supposing t-diagnosable. It is not impossible for all graphic models.
基金the National Natural Science Foundation of China under the pants No.69973016 and No.69733010.
文摘With the popularization of network applications and multiprocessor systems, dependability of systems has drawn considerable attention. This paper presents a new technique of node grouping for system-level fault diagnosis to simplify the complexity of large system di-agnosis. The technique transforms a complicated system to a group network, where each group may consist of many nodes that are either fault-free or faulty. It is proven that the transformation leads to a unique group network to ease system diagnosis. Then it studies systematically one-step t-faults diagnosis problem based on node grouping by means of the concept of hide-pendent point sets and gives a simple sufficient and necessary condition. The paper presents a diagnosis procedure for t-diagnosable systems. Furthermore, an efficient probabilistic diagnosis algorithm for practical applications is proposed based on the belief that most of the nodes in a system are fault-free. The result of software simulation shows that the probabilistic diagnosis provides high probability of correct diagnosis and low diagnosis cost, and is suitable for systems of any kind of topology.
