Issue No.02 - February (1994 vol.43)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.262134
<p>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.</p>
fault tolerant computing; distributed processing; computational complexity; fault identification algorithm; diagnosable systems; connection assignment; diagnosable system; graph models; permanent fault; PMC model; system-level faults; distributed computed architectures.
V.Tz. Radoytchevsky, "Comments on "An O(n/sup 2.5/) Fault Identification Algorithm for Diagnosable Systems", IEEE Transactions on Computers, vol.43, no. 2, pp. 254-255, February 1994, doi:10.1109/12.262134