mathematics Module
Interactive Simulation Screen
SYS_OK
Lesson Directive // Mission ProbabilityREF_CORE

The Risk of Failure

PsysP_{sys}==11−-(1(1−-pp)n)^n

Hover over a variable in the formula above, or see glossary below:

PsysP_{sys}
System Reliability
%
pp
Component Reliability
%
nn
Redundant Components
Count

In spaceflight, components fail. If a critical system relies on a single component with a 90% success rate, there is a 10% chance of complete mission failure. We express these chances as Fractions or decimals (e.g. 0.10).

INSIGHT: For single-point failures, the system reliability equals the component reliability.

Adding Redundancy

To increase reliability, engineers add backup components in parallel. The system only fails if ALL of the redundant components fail at the exact same time.

INSIGHT: The probability of all components failing is the failure rate of one component multiplied by itself n times.

Calculating System Success

First, calculate the probability of a single failure (1 - p). Then, calculate the probability that all n components fail: (1 - p)^n. Finally, subtract that from 1 to find the probability of at least one success.

INSIGHT: Even with low-reliability parts, high redundancy can create an ultra-reliable system.
Detailed Theory & ReferencesEXT_DOC

Boolean Algebra and Logic Gates

Boolean algebra, introduced by George Boole in 1847, is the branch of algebra in which the values of the variables are the truth values true and false, usually denoted 1 and 0. It is the foundational mathematical framework for all digital logic and computer science.

The AND Operator (Conjunction)

The logical AND operator yields true if and only if all of its operands are true. In mathematical notation, it is represented as A∧BA \land B, or simply A⋅BA \cdot B.

Hardware Implementation: Triple Modular Redundancy

In mission-critical aerospace applications (where radiation can cause bit-flips or hardware components can fail), a single logic gate is insufficient. Spacecraft flight computers utilise a fault-tolerant architecture called Triple Modular Redundancy (TMR).

In TMR, three identical independent computer processors execute the exact same boolean logic simultaneously. Their outputs are fed into a "majority voting" logic circuit. V=(A∧B)∨(B∧C)∨(A∧C)V = (A \land B) \lor (B \land C) \lor (A \land C) If processor A is struck by cosmic radiation and outputs a 0 while B and C output 1, the voting circuit evaluates as (0)∨(1)∨(0)=1(0) \lor (1) \lor (0) = 1. The error is masked, and the system continues operating correctly.

Reference: Mano, M. M., & Ciletti, M. D. (2012). Digital Design (5th ed.). Pearson.

AI NOTICE

AI Assistance Disclaimer: This module uses AI-assisted educational models and interactive visual representations to help explain scientific and mathematical concepts. For formal research or academic evaluation, please verify formulas and data against standard primary reference materials.