This paper gives a proof of a sharpened version of the conjecture in [1]. Letbf{C}^{r}ber-dimensional complex vector space and letg in {bf C}^{r}be the vector of branch admittances of an analog network. A subset of{bf C}^{r}is said to be ample if (i) its complement has Lebesgue measure zero, (ii) it is open, and (iii) it is dense. The sharpened version of the conjecture claims that thek-node fault testability condition [1] is satisfied on an ample subset of values ofg, if, and only if, for any setXof inaccessible nodes, there are at leastk + 1nodes inX^{C}(complement ofX) each of which is connected withXvia a branch. This is extremely powerful because the result depends only on the topology of a network and the condition can be checked by inspection. The proof justifies the fault location method developed in [1].
Published in:
Circuits and Systems, IEEE Transactions on
(Volume:31
,
Issue:
2
)
Date of Publication:
Feb 1984
- Page(s):
-
147
-
158
- ISSN :
-
0098-4094
- Digital Object Identifier :
-
10.1109/TCS.1984.1085478
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
06 January 2003
- Issue Date :
-
Feb 1984