|
Problemy Peredachi Informatsii, 1997, Volume 33, Issue 2, Pages 81–93
(Mi ppi370)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 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.
Received: 25.03.1996 Revised: 17.12.1996
Citation:
Yu. L. Sagalovich, V. Yu. Solomennikov, “Fault Detection in Network Realizations of Systems of Monotone Boolean Functions”, Probl. Peredachi Inf., 33:2 (1997), 81–93; Problems Inform. Transmission, 33:2 (1997), 163–173
Linking options:
https://www.mathnet.ru/eng/ppi370 https://www.mathnet.ru/eng/ppi/v33/i2/p81
|
Statistics & downloads: |
Abstract page: | 215 | Full-text PDF : | 90 |
|