Reliability prediction for a class of highly reliable digital systems

Three theorems which show that the reliability of a popular class of systems can be computed using small and simple models are presented. This class consists of systems that are assemblages of subsystems where each subsystem is a majority-voting threeplex plus spares or majority-voting fourplex plus spares. The theorems are error bounds for model reduction and simplification. The error bounds are given in terms of readily available system parameters. The three theorems have been applied to a system that has been used as an example that generates extremely large reliability models; the system considered is one version of AIPS (Advanced Information Processing System) for IAPSA (Integrated Airframe Propulsion System Architecture).<
>