DocumentCode
1026246
Title
Comments on "An O(n/sup 2.5/) fault identification algorithm for diagnosable systems"
Author
Radoytchevsky, V. Tz ; Shalaev, A. Ja
Author_Institution
Inst. of Sci. Res in Telecommun., Sofia, Bulgaria
Volume
43
Issue
2
fYear
1994
Firstpage
254
Lastpage
255
Abstract
For original paper see A.T. Dahbura and G.M. Masson, "An O(n/sup 2.5/) fault identification algorithm for diagnosable systems," IEEE Trans. Comput., vol. C-33, pp. 486-492, Jun. 1984. Dahbura and Masson suggested an alternative version of Hakimi-Amin\´s theorem about the necessary and sufficient conditions for the system, described by PMC model (1967), to be t/sub p/-diagnosable. The authors found systems with connection assignment that satisfy conditions of Dahbura-Masson\´s theorem but are not t/sub p/-diagnosable. In this correspondence they state the additional condition under which Dahbura-Masson\´s theorem will hold.<>
Keywords
computational complexity; distributed processing; fault tolerant computing; PMC model; connection assignment; diagnosable system; diagnosable systems; distributed computed architectures; fault identification algorithm; graph models; permanent fault; system-level faults; Computer architecture; Distributed computing; Fault diagnosis; Sufficient conditions; System testing;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.262134
Filename
262134
Link To Document