## Abstract

Four years have elapsed since the publication of [19], in which the mathematical aspects of reliability theory were surveyed. In the interim a great many papers have been written on the subject, making the theory of discrete system reliability a difficult area to survey in total perspective. The special problem of the improvement of discrete system reliability by the application of structural redundancy has grown into a full-fledged discipline, namely the problem of synthesizing discrete systems with a structure designed to abate the effects of component failures and unequal delays in the activation of those components on overall system operation. Consistent with the Soviet terminological state standard (GOST) [140], reliability is defined as the capability of an object to execute prescribed functions while maintaining its operational specifications within assigned limits for a required time period or during the performance of a required task. The reliability of discrete systems actually has two interpretations:

- a)
“infallibility,”* in the sense of the capacity of a discrete system to execute prescribed functions (the prescribed functional algorithm*) in the event of failure of a certain number of system components;

- b)
“stability,”† in the sense of the capacity of a discrete system to execute a prescribed functional algorithm in the event of changes in the time parameters of the system.

## Keywords

Discrete System Reliability Theory Component Failure Difficult Area Prescribe Function
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## Copyright information

© Plenum Press, New York 1972