RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1997 Volume 33, Issue 2, Pages 81–93 (Mi ppi370)

This article is cited in 3 papers

Automata Theory

Fault Detection in Network Realizations of Systems of Monotone Boolean Functions

Yu. L. Sagalovich, V. Yu. Solomennikov


Abstract: The minimal disjunctive normal form of a monotone Boolean function does not contain variables with negation and, therefore, permits a network realization without inverters, which is attractive in itself. On the other hand, a set of conjunctions without negations does not possess properties of a separating system, which creates an obstacle to fault detection in a network. Nevertheless, in this paper, we prove that, under some conditions, a network remains testable, and a considerable reduction of the volume of computations while constructing diagnosis facilities is achieved.

UDC: 621.391.1-503.5

Received: 25.03.1996
Revised: 17.12.1996


 English version:
Problems of Information Transmission, 1997, 33:2, 163–173

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026