Dr. H. Fujiwara of Osaka University, Osaka, Japan, has brought to our attention two errors in the above paper.1

This paper is concerned with automatic fault diagnosis for digital systems with multiple faults. Three problems are treated: 1) Probabilistic fault diagnosis is presented using the graph-theoretic model of Preparata et al. The necessary and sufficient conditions to correctly diagnose any fault set whose probability of occurrence is greater than t have been developed. Some simple sufficient conditions are also discussed. 2) A general model that contains as special cases both the graph-theoretic and the Russell-Kime models is developed. Conditions for T-fault diagnosability are given, thus settling some open problems introduced by Russell and Kime. 3) Finally, sequential T-fault diagnosability is considered. Existence of a class of systems requiring as little as n + T - 1 tests is shown. This improves significantly upon the previously best known class of systems that required n + 2T - 2 tests for sequential T-fault diagnosability.

During the last decade there has been considerable research activity devoted to the study of systems which could be modeled as networks. Whereas the subject of such research has ranged from network flows, reliable networks, electrical network theory, etc., most of the books that have appeared on the subject tend to emphsize either integer programming and network flows [1], or graph theory and its applications in electrical engineering [2]-[3]. As the title of the book suggests the authors, who are prolific contributors in the field, have taken a different approach. They have attempted to develop the theory of networks by organizing the book around the classes of physical problems rather than the techniques used to solve them.