Diagnosability in the decomposition approach for fault location in large analog networks

Abstract

Diagnosability of analog networks using Salama, Starzyk, and Bandler's fault-location algorithm is investigated. A network is said to be <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</tex> -diagnosable if, under the assumption that the network contains at most <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</tex> faulty subnetworks, all the faulty subnetworks can be located. A theorem for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</tex> -diagnosability of a network is derived.