RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2023 Number 62, Pages 71–82 (Mi pdm821)

Mathematical Backgrounds of Computer and Control System Reliability

Short fault detection tests for contact circuits under arbitrary weakly connected faults of contacts

K. A. Popkov

Keldysh Institute of Applied Mathematics, Moscow, Russia

Abstract: We prove that for any natural $k$, any Boolean function can be implemented by a two-pole contact circuit that is $k$-irredundant and allows a $k$-fault detection test of length no more than $3$ relative to arbitrary connected faults of contacts in groups, where each group consists of one closing and one opening contact. We establish that if the Boolean function is not self-dual, then this bound can be lowered to $2$.

Keywords: contact circuit, connected faults of contacts, fault detection test, Boolean function.

UDC: 519.718.7

DOI: 10.17223/20710410/62/6



© Steklov Math. Inst. of RAS, 2025