Study guide
13.2 System Reliability Architecture: Series, Parallel, k-out-of-n & Redundancy
PE Industrial and Systems Exam
Track your progress as you read
Finished sections get a check mark.
1 Exam Overview, Strategy & Systems Foundations
1.1 PE Industrial Exam Format, Official Specification & Reference Handbook Strategy 1.2 System Analysis Tools, Process Definition, Requirements Engineering & QFD 1.3 Performance Measures: Output, Productivity, OEE, Cost & Environmental Sustainability 1.4 Process Types (Discrete, Continuous, Manufacturing, Service) & Value Analysis/Engineering
2 Optimization, Queueing, Simulation, Networks & Markov Chains
2.1 Linear Programming Formulation, Graphical Solutions & Sensitivity Analysis 2.2 Queueing Theory Models (M/M/1, M/M/s) & Little's Law Applications 2.3 Discrete-Event Simulation, Random Variates & Model Validation 2.4 Graph Theory & Network Models: Shortest Path, Minimal Spanning Tree & Maximum Flow 2.5 Markov Chains: Transition Matrices, Steady-State Probabilities & Absorbing States 2.6 Decision Trees, Expected Value & Bottleneck Analysis (Theory of Constraints)
3 Project Management & Planning
3.1 Project Scheduling with CPM and PERT: Critical Path, Float, Probability & Crashing 3.2 Project Planning & Control: Scope and WBS, Gantt Charts, Critical Chain (CCPM), Risk & Earned Value
4 Facility Layout, Space, Capacity & Material Handling
4.1 Systematic Layout Planning (SLP) & Activity Relationship (REL) Analysis 4.2 Workstation Design, Aisle Sizing & Space Requirements Planning 4.3 Capacity Analysis: Machine Requirements, Scrap Allowances & Personnel Requirements 4.4 Material Handling Equipment Selection, Unit Loads & Handling Principles
5 Site Location, Warehousing & Facility Economics
5.1 Facility Location Models: Center of Gravity & Minisum / Minimax Distance 5.2 Warehousing Systems, Storage Assignment & Order Picking Operations 5.3 Facility Life-Cycle Economics, Replacement Analysis & Rearrangement Costs
6 Demand Forecasting, Production Planning, MRP & JIT
6.1 Demand Forecasting Methods: Moving Averages, Exponential Smoothing & Error Metrics 6.2 Aggregate Planning Strategies & Master Production Scheduling (MPS) 6.3 Material Requirements Planning (MRP), Bill of Materials & Capacity Planning 6.4 Just-in-Time & Lean Production Planning: Pull Systems, Kanban Sizing, Heijunka & SMED
7 Inventory Systems, Scheduling, Logistics & Transportation Modes
7.1 Deterministic Inventory Control: Classical EOQ, EPQ & Quantity Discounts 7.2 Stochastic Inventory Management: Safety Stock, Continuous / Periodic Review & Newsvendor 7.3 Production Sequencing, Dispatching Rules & Johnson's Algorithm 7.4 Supply Chain Logistics, Transportation Simplex & Distribution Network Design 7.5 Transportation Modes, Freight Economics & the Transshipment Model
8 Engineering Economics, Break-Even Analysis & Costing Systems
8.1 Equivalence, Cash Flow Analysis & Discounted Cash Flow Metrics (PW, FW, EAC) 8.2 Rate of Return Analysis (IRR, Incremental IRR) & Benefit-Cost (B/C) Ratios 8.3 Asset Depreciation (MACRS, Straight-Line), Tax Effects & Replacement Decisions 8.4 Break-Even Analysis, Technical Capability Assessment & Costing Systems (Traditional, ABC & Standard Costs)
9 Methods Engineering, Work Measurement, Learning Curves, Line Balancing & Process Planning
9.1 Methods Analysis, Process Charting & Motion Study (Therbligs, 5S) 9.2 Worker–Machine (Man–Machine) Charts, Multiple Activity Analysis & Synchronous Servicing 9.3 Time Study Fundamentals, Performance Rating & Allowance Factors 9.4 Predetermined Motion Time Systems (PMTS, MTM, MOST) & Work Sampling 9.5 Learning Curves: Unit and Cumulative-Average Models, Learning Rates & Applications 9.6 Assembly Line Balancing, Precedence Constraints & Efficiency Heuristics 9.7 Manufacturing & Service Process Planning: Operation Selection, Sequencing, Route Sheets, Fixturing & Mistake Proofing
10 Ergonomics, Human Capacity, Occupational Safety & DART Rates
10.1 Anthropometry, Percentile Design, Workstation Ergonomics & Link Analysis 10.2 Industrial Biomechanics, the NIOSH Lifting Equation & Lifting Aids 10.3 Limits of Human Capacity & Risk-Factor Tools: Work Physiology, Strength, Range of Motion, Vision, RULA & Slip Resistance 10.4 Environmental Ergonomics (Noise, Heat, Illumination), Human-Machine Systems & OSHA Safety 10.5 Safety Codes, Standards & Voluntary Guidelines (OSHA, ANSI, NIOSH, MIL-STD) and DART Rate Calculations
11 Statistical Process Control & Process Capability
11.1 Statistical Process Control for Variables (X-bar/R and X-bar/s Charts) 11.2 Statistical Process Control for Attributes (p, np, c, and u Charts) 11.3 Process Capability Indices (Cp, Cpk, Cpm, Pp, Ppk) & Sigma Levels
12 Design of Experiments, Acceptance Sampling & Quality Systems
12.1 Design of Experiments: 2^k Factorials, ANOVA & Taguchi Robust Design 12.2 Acceptance Sampling: OC Curves, AQL, LTPD, AOQL, Z1.4/MIL-STD-105E & Dodge-Romig 12.3 Quality Systems (Deming, TQM, ISO 9000, Benchmarking), Root Cause Analysis & DMAIC
13 Reliability Engineering & Maintenance Systems
13.1 Reliability Modeling, Failure Rates (lambda) & Life Distributions (Exponential, Weibull) 13.2 System Reliability Architecture: Series, Parallel, k-out-of-n & Redundancy 13.3 Equipment Maintenance Engineering, Availability (A), MTBF/MTTR & RCM
13.2 System Reliability Architecture: Series, Parallel, k-out-of-n & Redundancy
Key Takeaways Explain This Topic AI
In Series systems (weakest link), survival requires every component to function ( R s = ∏ R i R_s = \prod R_i R s = ∏ R i ); failure rates are additive ( λ s = ∑ λ i \lambda_s = \sum \lambda_i λ s = ∑ λ i ), pulling system MTTF below the weakest component.
In Active Parallel systems (hot redundancy), the system survives if at least one component functions ( R s = 1 − ∏ ( 1 − R i ) R_s = 1 - \prod(1 - R_i) R s = 1 − ∏ ( 1 − R i ) ), but exhibits diminishing MTTF returns: MTTF s = ( 1 / λ ) ∑ i = 1 n ( 1 / i ) \text{MTTF}_s = (1/\lambda) \sum_{i=1}^n (1/i) MTTF s = ( 1/ λ ) ∑ i = 1 n ( 1/ i ) .
Cold Standby redundancy achieves higher MTTF than active parallel redundancy because dormant backup units experience zero operational stress ( λ dormant = 0 \lambda_{\text{dormant}} = 0 λ dormant = 0 ), yielding Erlang renewal reliability R s ( t ) = e − λ t ( 1 + λ t ) R_s(t) = e^{-\lambda t}(1 + \lambda t) R s ( t ) = e − λ t ( 1 + λ t ) under perfect switching.
In k k k -out-of- n : G n:G n : G voting architectures, system reliability improves if and only if component reliability exceeds a threshold; a 2-out-of-3 voting system ( R 2 / 3 = 3 R 2 − 2 R 3 R_{2/3} = 3R^2 - 2R^3 R 2/3 = 3 R 2 − 2 R 3 ) improves reliability when R > 0.50 R > 0.50 R > 0.50 .
Component-level redundancy mathematically dominates system-level redundancy ( R comp ≥ R sys R_{\text{comp}} \ge R_{\text{sys}} R comp ≥ R sys ) because cross-strapping between sub-stages tolerates mixed component failure combinations.
Last updated: October 2026
13.2 System Reliability Architecture: Series, Parallel, k-out-of-n & Redundancy
Industrial plants, automation systems, and mission-critical production facilities rarely consist of single isolated components. Instead, they comprise complex networks of mechanical drives, electrical sensors, controllers, and fluid circuits. To analyze and design reliable systems, industrial engineers construct Reliability Block Diagrams (RBDs) that map the functional dependencies of the underlying hardware.
1. Series System Architecture (Weakest-Link Principle)
In a Series System , all n n n components are mutually essential for overall system function. If any single component suffers functional failure, the entire system ceases operation. +---------+ +---------+ +---------+ +---------+
- -| Comp 1 |-----| Comp 2 |-----| ... |-----| Comp n |--
- +---------+ +---------+ +---------+ +---------+
- Reliability Formulation
Assuming component failures are statistically independent events:
R s ( t ) = P ( T 1 > t ∩ T 2 > t ∩ ⋯ ∩ T n > t ) = ∏ i = 1 n R i ( t ) R_s(t) = P(T_1 > t \cap T_2 > t \cap \dots \cap T_n > t) = \prod_{i=1}^n R_i(t) R s ( t ) = P ( T 1 > t ∩ T 2 > t ∩ ⋯ ∩ T n > t ) = ∏ i = 1 n R i ( t )
Because 0 ≤ R i ( t ) ≤ 1 0 \le R_i(t) \le 1 0 ≤ R i ( t ) ≤ 1 , the product satisfies:
R s ( t ) ≤ min { R 1 ( t ) , R 2 ( t ) , … , R n ( t ) } R_s(t) \le \min\{R_1(t), R_2(t), \dots, R_n(t)\} R s ( t ) ≤ min { R 1 ( t ) , R 2 ( t ) , … , R n ( t )}
Engineering Implication: The reliability of a series system is strictly lower than the reliability of its single weakest component. Adding components in series inevitably decreases system reliability.
Exponential Series Systems
If each component i i i follows an exponential distribution with constant failure rate λ i \lambda_i λ i :
R s ( t ) = ∏ i = 1 n e − λ i t = exp ( − ( ∑ i = 1 n λ i ) t ) = e − λ s t R_s(t) = \prod_{i=1}^n e^{-\lambda_i t} = \exp\left( -\left(\sum_{i=1}^n \lambda_i\right) t \right) = e^{-\lambda_s t} R s ( t ) = ∏ i = 1 n e − λ i t = exp ( − ( ∑ i = 1 n λ i ) t ) = e − λ s t
The overall system failure rate is the direct linear sum of the individual component failure rates:
λ s = ∑ i = 1 n λ i \lambda_s = \sum_{i=1}^n \lambda_i λ s = ∑ i = 1 n λ i
MTTF s = 1 λ s = 1 ∑ i = 1 n λ i \text{MTTF}_s = \frac{1}{\lambda_s} = \frac{1}{\sum_{i=1}^n \lambda_i} MTTF s = λ s 1 = ∑ i = 1 n λ i 1
2. Active Parallel System Architecture (Hot Redundancy)
In an Active Parallel System (also known as Hot Redundancy ), all n n n redundant units operate concurrently online. The system performs its intended function as long as at least one component remains operational. The system fails if and only if all n n n components fail. +---------+
- +--| Comp 1 |--+
- | +---------+ |
- | +---------+ |
- ---+--| Comp 2 |--+----
- | +---------+ |
- | +---------+ |
- +--| Comp n |--+
- +---------+
- Reliability Formulation
The system cumulative failure probability F s ( t ) F_s(t) F s ( t ) requires the simultaneous failure of all independent units:
F s ( t ) = ∏ i = 1 n F i ( t ) = ∏ i = 1 n ( 1 − R i ( t ) ) F_s(t) = \prod_{i=1}^n F_i(t) = \prod_{i=1}^n \left(1 - R_i(t)\right) F s ( t ) = ∏ i = 1 n F i ( t ) = ∏ i = 1 n ( 1 − R i ( t ) )
R s ( t ) = 1 − F s ( t ) = 1 − ∏ i = 1 n ( 1 − R i ( t ) ) R_s(t) = 1 - F_s(t) = 1 - \prod_{i=1}^n \left(1 - R_i(t)\right) R s ( t ) = 1 − F s ( t ) = 1 − ∏ i = 1 n ( 1 − R i ( t ) )
For n n n identical components with reliability R ( t ) R(t) R ( t ) :
- R s ( t ) = 1 − [ 1 − R ( t ) ] n R_s(t) = 1 - [1 - R(t)]^n R s ( t ) = 1 − [ 1 − R ( t ) ] n
- Mean Time To Failure for Parallel Exponential Systems
Consider n n n identical components operating in active parallel, each with exponential failure rate λ \lambda λ . While each individual component has a constant hazard rate, the parallel system as an entity does not have an exponential life distribution; its failure rate increases with time as redundant units fail.
MTTF s = ∫ 0 ∞ R s ( t ) d t = ∫ 0 ∞ ( 1 − [ 1 − e − λ t ] n ) d t \text{MTTF}_s = \int_0^\infty R_s(t)\,dt = \int_0^\infty \left( 1 - [1 - e^{-\lambda t}]^n \right) dt MTTF s = ∫ 0 ∞ R s ( t ) d t = ∫ 0 ∞ ( 1 − [ 1 − e − λ t ] n ) d t
Utilizing the standard order statistics renewal formulation:
MTTF s = 1 λ ∑ i = 1 n 1 i = 1 λ ( 1 + 1 2 + 1 3 + ⋯ + 1 n ) \text{MTTF}_s = \frac{1}{\lambda} \sum_{i=1}^n \frac{1}{i} = \frac{1}{\lambda} \left( 1 + \frac{1}{2} + \frac{1}{3} + \dots + \frac{1}{n} \right) MTTF s = λ 1 ∑ i = 1 n i 1 = λ 1 ( 1 + 2 1 + 3 1 + ⋯ + n 1 )
Law of Diminishing Returns in Active Redundancy
Single unit ( n = 1 n = 1 n = 1 ): MTTF 1 = 1 λ = 1.000 MTTF \text{MTTF}_1 = \frac{1}{\lambda} = 1.000\,\text{MTTF} MTTF 1 = λ 1 = 1.000 MTTF
Dual unit ( n = 2 n = 2 n = 2 ): MTTF 2 = 1 λ ( 1 + 1 2 ) = 1.5 λ = 1.500 MTTF \text{MTTF}_2 = \frac{1}{\lambda}\left(1 + \frac{1}{2}\right) = \frac{1.5}{\lambda} = 1.500\,\text{MTTF} MTTF 2 = λ 1 ( 1 + 2 1 ) = λ 1.5 = 1.500 MTTF (Adds 50% life)
Triple unit ( n = 3 n = 3 n = 3 ): MTTF 3 = 1 λ ( 1 + 1 2 + 1 3 ) = 1.833 λ = 1.833 MTTF \text{MTTF}_3 = \frac{1}{\lambda}\left(1 + \frac{1}{2} + \frac{1}{3}\right) = \frac{1.833}{\lambda} = 1.833\,\text{MTTF} MTTF 3 = λ 1 ( 1 + 2 1 + 3 1 ) = λ 1.833 = 1.833 MTTF (Adds 33% life)
Quad unit ( n = 4 n = 4 n = 4 ): MTTF 4 = 1 λ ( 1 + 1 2 + 1 3 + 1 4 ) = 2.083 λ = 2.083 MTTF \text{MTTF}_4 = \frac{1}{\lambda}\left(1 + \frac{1}{2} + \frac{1}{3} + \frac{1}{4}\right) = \frac{2.083}{\lambda} = 2.083\,\text{MTTF} MTTF 4 = λ 1 ( 1 + 2 1 + 3 1 + 4 1 ) = λ 2.083 = 2.083 MTTF (Adds 25% life)
Each successive redundant component provides progressively smaller incremental improvements in expected system operational lifetime while imposing linear increases in cost, mass, and volume.
3. Standby Redundancy (Cold, Warm, Hot)
In standby redundancy, secondary components remain offline or at reduced operational load until an active primary component fails, at which point a sensing and switching mechanism transfers operation to the standby unit.
Comparison of Standby Operational Modes
Standby Category Operational State of Dormant Unit Standby Failure Rate λ s \lambda_s λ s Switchover Stress & Transient System MTTF Advantage
Cold Standby Unpowered, completely de-energized λ s = 0 \lambda_s = 0 λ s = 0 (Zero dormant aging) High thermal/electrical inrush shock upon transfer Maximizes MTTF; no wear-out during standby
Warm Standby Idling, low-power pre-heat state 0 < λ s < λ 1 0 < \lambda_s < \lambda_1 0 < λ s < λ 1 Moderate transient stress; faster startup response Intermediate balance between life and response time
Hot Standby Fully powered, operational in parallel λ s = λ 1 \lambda_s = \lambda_1 λ s = λ 1 Seamless zero-downtime transfer Functionally equivalent to active parallel redundancy
Mathematical Formulation: Cold Standby with Perfect Switching
Consider two identical components with failure rate λ \lambda λ . Component 1 operates initially while Component 2 resides in cold standby (dormant failure rate λ 2 = 0 \lambda_2 = 0 λ 2 = 0 ). When Component 1 fails at time T 1 T_1 T 1 , an ideal automatic transfer switch ( P s w = 1.0 P_{sw} = 1.0 P s w = 1.0 ) instantly energizes Component 2, which then operates until failure at time T 2 T_2 T 2 .
Because the two operational intervals are independent and identically distributed exponential random variables, the total time to system failure is T = T 1 + T 2 T = T_1 + T_2 T = T 1 + T 2 , which follows a 2-stage Erlang distribution (Gamma distribution with α = 2 , β = λ \alpha = 2, \beta = \lambda α = 2 , β = λ ):
R s ( t ) = P ( T 1 + T 2 > t ) = P ( T 1 > t ) + P ( T 1 ≤ t ∩ T 1 + T 2 > t ) R_s(t) = P(T_1 + T_2 > t) = P(T_1 > t) + P(T_1 \le t \cap T_1 + T_2 > t) R s ( t ) = P ( T 1 + T 2 > t ) = P ( T 1 > t ) + P ( T 1 ≤ t ∩ T 1 + T 2 > t )
R s ( t ) = e − λ t + ∫ 0 t ( λ e − λ u ) e − λ ( t − u ) d u = e − λ t + λ t e − λ t = e − λ t ( 1 + λ t ) R_s(t) = e^{-\lambda t} + \int_0^t (\lambda e^{-\lambda u}) e^{-\lambda(t - u)}\,du = e^{-\lambda t} + \lambda t e^{-\lambda t} = e^{-\lambda t}(1 + \lambda t) R s ( t ) = e − λ t + ∫ 0 t ( λ e − λ u ) e − λ ( t − u ) d u = e − λ t + λ t e − λ t = e − λ t ( 1 + λ t )
The system MTTF is the direct sum of the expected lives:
MTTF cold = E [ T 1 ] + E [ T 2 ] = 1 λ + 1 λ = 2 λ \text{MTTF}_{\text{cold}} = E[T_1] + E[T_2] = \frac{1}{\lambda} + \frac{1}{\lambda} = \frac{2}{\lambda} MTTF cold = E [ T 1 ] + E [ T 2 ] = λ 1 + λ 1 = λ 2
Decisive Engineering Comparison:
Active parallel dual-unit system: MTTF active = 1.5 λ \text{MTTF}_{\text{active}} = \frac{1.5}{\lambda} MTTF active = λ 1.5
Cold standby dual-unit system: MTTF cold = 2.0 λ \text{MTTF}_{\text{cold}} = \frac{2.0}{\lambda} MTTF cold = λ 2.0
Cold standby provides a 33.3% higher MTTF than active parallel redundancy because the standby unit preserves its full operational lifespan while the primary unit operates.
Impact of Imperfect Switching
If the transfer switch has a static operational probability of successful transfer P s w < 1.0 P_{sw} < 1.0 P s w < 1.0 , the standby reliability equation modifies to:
R s ( t ) = e − λ t + P s w λ t e − λ t = e − λ t ( 1 + P s w λ t ) R_s(t) = e^{-\lambda t} + P_{sw} \lambda t e^{-\lambda t} = e^{-\lambda t}(1 + P_{sw} \lambda t) R s ( t ) = e − λ t + P s w λ t e − λ t = e − λ t ( 1 + P s w λ t )
MTTF imperfect = 1 λ + P s w 1 λ = 1 + P s w λ \text{MTTF}_{\text{imperfect}} = \frac{1}{\lambda} + P_{sw} \frac{1}{\lambda} = \frac{1 + P_{sw}}{\lambda} MTTF imperfect = λ 1 + P s w λ 1 = λ 1 + P s w
If switch reliability drops to P s w < 0.50 P_{sw} < 0.50 P s w < 0.50 , the cold standby architecture yields lower MTTF than active parallel redundancy.
4. k-out-of-n System Architecture ( k / n : G k/n:G k / n : G )
A k k k -out-of- n : G n:G n : G System (Good) consists of n n n total components operating simultaneously, of which at least k k k must remain functional for the system to operate successfully. If ( n − k + 1 ) (n - k + 1) ( n − k + 1 ) components fail, the system suffers functional breakdown.
Binomial Formulation for Identical Components
When all n n n components are mutually independent and possess identical operational reliability R ( t ) R(t) R ( t ) :
R k / n ( t ) = ∑ j = k n ( n j ) [ R ( t ) ] j [ 1 − R ( t ) ] n − j R_{k/n}(t) = \sum_{j=k}^n \binom{n}{j} [R(t)]^j [1 - R(t)]^{n - j} R k / n ( t ) = ∑ j = k n ( j n ) [ R ( t ) ] j [ 1 − R ( t ) ] n − j
Where ( n j ) = n ! j ! ( n − j ) ! \binom{n}{j} = \frac{n!}{j!(n - j)!} ( j n ) = j ! ( n − j )! n ! represents the binomial combination coefficient.
Special Boundary Cases
k = n k = n k = n (Series System): R n / n ( t ) = ( n n ) [ R ( t ) ] n = [ R ( t ) ] n R_{n/n}(t) = \binom{n}{n} [R(t)]^n = [R(t)]^n R n / n ( t ) = ( n n ) [ R ( t ) ] n = [ R ( t ) ] n
k = 1 k = 1 k = 1 (Parallel System): R 1 / n ( t ) = ∑ j = 1 n ( n j ) R j ( 1 − R ) n − j = 1 − [ 1 − R ( t ) ] n R_{1/n}(t) = \sum_{j=1}^n \binom{n}{j} R^j (1 - R)^{n-j} = 1 - [1 - R(t)]^n R 1/ n ( t ) = ∑ j = 1 n ( j n ) R j ( 1 − R ) n − j = 1 − [ 1 − R ( t ) ] n
Triple Modular Redundancy (TMR / 2-out-of-3 Voting)
Triple Modular Redundancy is the standard fault-tolerant architecture utilized in industrial safety instrumented systems (SIS), nuclear power plant trip computers, and fly-by-wire aerospace avionics. Three identical channels process data in parallel, feeding into a majority voting gate where the system output matches the majority consensus ( k = 2 , n = 3 k = 2, n = 3 k = 2 , n = 3 ):
R 2 / 3 ( t ) = ( 3 2 ) R 2 ( 1 − R ) + ( 3 3 ) R 3 = 3 R 2 ( 1 − R ) + R 3 = 3 R 2 − 2 R 3 R_{2/3}(t) = \binom{3}{2} R^2(1 - R) + \binom{3}{3} R^3 = 3R^2(1 - R) + R^3 = 3R^2 - 2R^3 R 2/3 ( t ) = ( 2 3 ) R 2 ( 1 − R ) + ( 3 3 ) R 3 = 3 R 2 ( 1 − R ) + R 3 = 3 R 2 − 2 R 3
Crossover Analysis of Voting Systems
To determine when TMR provides a reliability benefit over a non-redundant single component, set R 2 / 3 = R R_{2/3} = R R 2/3 = R :
3 R 2 − 2 R 3 = R ⟹ 2 R 3 − 3 R 2 + R = 0 3R^2 - 2R^3 = R \implies 2R^3 - 3R^2 + R = 0 3 R 2 − 2 R 3 = R ⟹ 2 R 3 − 3 R 2 + R = 0
Factoring out R ( 2 R − 1 ) ( R − 1 ) = 0 R(2R - 1)(R - 1) = 0 R ( 2 R − 1 ) ( R − 1 ) = 0 yields critical threshold points at R = 0 R = 0 R = 0 , R = 0.5 R = 0.5 R = 0.5 , and R = 1.0 R = 1.0 R = 1.0 .
If R > 0.50 R > 0.50 R > 0.50 : R 2 / 3 > R R_{2/3} > R R 2/3 > R (TMR improves system reliability). Example: For R = 0.90 R = 0.90 R = 0.90 , R 2 / 3 = 3 ( 0.90 ) 2 − 2 ( 0.90 ) 3 = 2.43 − 1.458 = 0.9720 R_{2/3} = 3(0.90)^2 - 2(0.90)^3 = 2.43 - 1.458 = 0.9720 R 2/3 = 3 ( 0.90 ) 2 − 2 ( 0.90 ) 3 = 2.43 − 1.458 = 0.9720 (Reliability gains 7.2%).
If R < 0.50 R < 0.50 R < 0.50 : R 2 / 3 < R R_{2/3} < R R 2/3 < R (TMR degrades system reliability because the probability of two or more simultaneous faulty channels exceeds the probability of a single channel failing). Example: For R = 0.40 R = 0.40 R = 0.40 , R 2 / 3 = 3 ( 0.40 ) 2 − 2 ( 0.40 ) 3 = 0.48 − 0.128 = 0.3520 R_{2/3} = 3(0.40)^2 - 2(0.40)^3 = 0.48 - 0.128 = 0.3520 R 2/3 = 3 ( 0.40 ) 2 − 2 ( 0.40 ) 3 = 0.48 − 0.128 = 0.3520 .
5. Component-Level vs. System-Level Redundancy
A critical optimization problem in systems engineering addresses where to implement redundancy within multi-stage architectures: should entire systems be duplicated in parallel, or should parallel redundancy be applied to individual components at each sub-stage?
Mathematical Formulation
Consider a two-stage functional chain requiring Subsystem A A A (reliability R A R_A R A ) in series with Subsystem B B B (reliability R B R_B R B ). Suppose an engineering budget permits doubling hardware resources (2 units of A A A and 2 units of B B B ).
Configuration 1: System-Level Redundancy
Two complete series channels are connected in active parallel. The system functions if Channel 1 OR Channel 2 functions. +---------+ +---------+
- +--| Comp A1 |-----| Comp B1 |--+
- | +---------+ +---------+ |
- ---+ +----
- | +---------+ +---------+ |
- +--| Comp A2 |-----| Comp B2 |--+
- +---------+ +---------+
- Channel reliability: R chan = R A R B R_{\text{chan}} = R_A R_B R chan = R A R B
R sys = 1 − ( 1 − R chan ) 2 = 1 − ( 1 − R A R B ) 2 = 2 R A R B − R A 2 R B 2 R_{\text{sys}} = 1 - (1 - R_{\text{chan}})^2 = 1 - (1 - R_A R_B)^2 = 2 R_A R_B - R_A^2 R_B^2 R sys = 1 − ( 1 − R chan ) 2 = 1 − ( 1 − R A R B ) 2 = 2 R A R B − R A 2 R B 2
Configuration 2: Component-Level Redundancy
Parallel redundancy is applied to Subsystem A A A , which is connected in series with a parallel redundant bank of Subsystem B B B . +---------+ +---------+
- +--| Comp A1 |--+ +--| Comp B1 |--+
- | +---------+ | | +---------+ |
- ---+ +----+ +----
- | +---------+ | | +---------+ |
- +--| Comp A2 |--+ +--| Comp B2 |--+
- +---------+ +---------+
R A , par = 1 − ( 1 − R A ) 2 = 2 R A − R A 2 R_{A,\text{par}} = 1 - (1 - R_A)^2 = 2R_A - R_A^2 R A , par = 1 − ( 1 − R A ) 2 = 2 R A − R A 2
R B , par = 1 − ( 1 − R B ) 2 = 2 R B − R B 2 R_{B,\text{par}} = 1 - (1 - R_B)^2 = 2R_B - R_B^2 R B , par = 1 − ( 1 − R B ) 2 = 2 R B − R B 2
R comp = R A , par × R B , par = ( 2 R A − R A 2 ) ( 2 R B − R B 2 ) = 4 R A R B − 2 R A R B 2 − 2 R A 2 R B + R A 2 R B 2 R_{\text{comp}} = R_{A,\text{par}} \times R_{B,\text{par}} = (2R_A - R_A^2)(2R_B - R_B^2) = 4 R_A R_B - 2 R_A R_B^2 - 2 R_A^2 R_B + R_A^2 R_B^2 R comp = R A , par × R B , par = ( 2 R A − R A 2 ) ( 2 R B − R B 2 ) = 4 R A R B − 2 R A R B 2 − 2 R A 2 R B + R A 2 R B 2
Formal Mathematical Proof ( R comp ≥ R sys R_{\text{comp}} \ge R_{\text{sys}} R comp ≥ R sys )
Subtracting R sys R_{\text{sys}} R sys from R comp R_{\text{comp}} R comp :
R comp − R sys = ( 4 R A R B − 2 R A R B 2 − 2 R A 2 R B + R A 2 R B 2 ) − ( 2 R A R B − R A 2 R B 2 ) R_{\text{comp}} - R_{\text{sys}} = \left(4 R_A R_B - 2 R_A R_B^2 - 2 R_A^2 R_B + R_A^2 R_B^2\right) - \left(2 R_A R_B - R_A^2 R_B^2\right) R comp − R sys = ( 4 R A R B − 2 R A R B 2 − 2 R A 2 R B + R A 2 R B 2 ) − ( 2 R A R B − R A 2 R B 2 )
R comp − R sys = 2 R A R B − 2 R A R B 2 − 2 R A 2 R B + 2 R A 2 R B 2 R_{\text{comp}} - R_{\text{sys}} = 2 R_A R_B - 2 R_A R_B^2 - 2 R_A^2 R_B + 2 R_A^2 R_B^2 R comp − R sys = 2 R A R B − 2 R A R B 2 − 2 R A 2 R B + 2 R A 2 R B 2
Factoring 2 R A R B 2 R_A R_B 2 R A R B :
R comp − R sys = 2 R A R B ( 1 − R B − R A + R A R B ) = 2 R A R B ( 1 − R A ) ( 1 − R B ) R_{\text{comp}} - R_{\text{sys}} = 2 R_A R_B \left( 1 - R_B - R_A + R_A R_B \right) = 2 R_A R_B (1 - R_A)(1 - R_B) R comp − R sys = 2 R A R B ( 1 − R B − R A + R A R B ) = 2 R A R B ( 1 − R A ) ( 1 − R B )
Because 0 ≤ R A ≤ 1 0 \le R_A \le 1 0 ≤ R A ≤ 1 and 0 ≤ R B ≤ 1 0 \le R_B \le 1 0 ≤ R B ≤ 1 , every term in the product 2 R A R B ( 1 − R A ) ( 1 − R B ) 2 R_A R_B (1 - R_A)(1 - R_B) 2 R A R B ( 1 − R A ) ( 1 − R B ) is non-negative:
R comp − R sys ≥ 0 ⟹ R comp ≥ R sys R_{\text{comp}} - R_{\text{sys}} \ge 0 \implies R_{\text{comp}} \ge R_{\text{sys}} R comp − R sys ≥ 0 ⟹ R comp ≥ R sys
Physical Reliability Insight
Why does component-level redundancy guarantee equal or superior reliability?
In System-Level Redundancy, if Component A 1 A_1 A 1 fails in Channel 1 and Component B 2 B_2 B 2 fails in Channel 2, both channels are disabled , precipitating complete system failure.
In Component-Level Redundancy, internal cross-strapping between stages enables the surviving units to cross-connect: operational unit A 2 A_2 A 2 powers operational unit B 1 B_1 B 1 , preserving system continuity.
6. Complex Networks: Minimal Tie Sets and Minimal Cut Sets
When systems cannot be resolved by simple series and parallel reductions (e.g., bridge circuits, cross-strapped distributed networks), reliability engineers employ Minimal Tie Sets and Minimal Cut Sets .
Minimal Tie Sets (Path Sets)
A Tie Set is a group of components whose operation ensures system operation. A Minimal Tie Set is a path set that contains no redundant components; if any component in the minimal tie set fails, that specific operational path is broken.
Let T 1 , T 2 , … , T m T_1, T_2, \dots, T_m T 1 , T 2 , … , T m be the m m m minimal tie sets of a system. The system functions if at least one minimal tie set functions:
- R s = P ( ⋃ j = 1 m T j ) R_s = P\left( \bigcup_{j=1}^m T_j \right) R s = P ( ⋃ j = 1 m T j )
- Minimal Cut Sets
A Cut Set is a group of components whose simultaneous failure causes total system failure. A Minimal Cut Set contains no subset of components whose failure would independently fail the system.
Let C 1 , C 2 , … , C k C_1, C_2, \dots, C_k C 1 , C 2 , … , C k be the k k k minimal cut sets. The system fails if any minimal cut set fails:
F s = P ( ⋃ i = 1 k C i ) ⟹ R s = 1 − P ( ⋃ i = 1 k C i ) F_s = P\left( \bigcup_{i=1}^k C_i \right) \implies R_s = 1 - P\left( \bigcup_{i=1}^k C_i \right) F s = P ( ⋃ i = 1 k C i ) ⟹ R s = 1 − P ( ⋃ i = 1 k C i )
Esary-Proschan Reliability Bounds
For complex positive-dependent networks:
∏ i = 1 k ( 1 − P ( C i ) ) ≤ R s ≤ 1 − ∏ j = 1 m ( 1 − P ( T j ) ) \prod_{i=1}^k \left(1 - P(C_i)\right) \le R_s \le 1 - \prod_{j=1}^m \left(1 - P(T_j)\right) ∏ i = 1 k ( 1 − P ( C i ) ) ≤ R s ≤ 1 − ∏ j = 1 m ( 1 − P ( T j ) )
- 7. Worked Numerical Example: Architectural Comparison
- Problem Formulation
A safety instrumented shutdown system in a chemical synthesis reactor consists of two functional stages in series:
Stage A: Pressure Transmitter Subsystem, with single-unit reliability R A = 0.90 R_A = 0.90 R A = 0.90 .
Stage B: Automated Depressurization Valve, with single-unit reliability R B = 0.85 R_B = 0.85 R B = 0.85 .
An engineering reliability audit mandates evaluating four architectural options:
Architecture 1: Baseline non-redundant series configuration ( A − B A - B A − B ).
Architecture 2: System-level active redundancy (two identical series channels in parallel).
Architecture 3: Component-level active redundancy (parallel pair of A A A in series with parallel pair of B B B ).
Architecture 4: Cold standby configuration for Stage A (primary A 1 A_1 A 1 with λ A = 1.0 × 10 − 3 hr − 1 \lambda_A = 1.0 \times 10^{-3}\text{ hr}^{-1} λ A = 1.0 × 1 0 − 3 hr − 1 , identical cold backup A 2 A_2 A 2 with perfect switch P s w = 1.0 P_{sw} = 1.0 P s w = 1.0 , mission time t = 200 t = 200 t = 200 hours) driving a single Stage B valve with R B = 0.85 R_B = 0.85 R B = 0.85 .
- Step-by-Step Numerical Calculations
- Architecture 1: Baseline Series System
R arch1 = R A × R B = ( 0.9000 ) ( 0.8500 ) = 0.765000 ⟹ 76.50 % R_{\text{arch1}} = R_A \times R_B = (0.9000)(0.8500) = 0.765000 \implies 76.50\% R arch1 = R A × R B = ( 0.9000 ) ( 0.8500 ) = 0.765000 ⟹ 76.50%
Architecture 2: System-Level Redundancy
Each channel has reliability R chan = 0.7650 R_{\text{chan}} = 0.7650 R chan = 0.7650 . R arch2 = 1 − ( 1 − R chan ) 2 = 1 − ( 1 − 0.7650 ) 2 = 1 − ( 0.2350 ) 2 R_{\text{arch2}} = 1 - (1 - R_{\text{chan}})^2 = 1 - (1 - 0.7650)^2 = 1 - (0.2350)^2 R arch2 = 1 − ( 1 − R chan ) 2 = 1 − ( 1 − 0.7650 ) 2 = 1 − ( 0.2350 ) 2 R arch2 = 1 − 0.055225 = 0.944775 ⟹ 94.48 % R_{\text{arch2}} = 1 - 0.055225 = 0.944775 \implies 94.48\% R arch2 = 1 − 0.055225 = 0.944775 ⟹ 94.48%
Architecture 3: Component-Level Redundancy
Stage A parallel reliability: R A , par = 1 − ( 1 − R A ) 2 = 1 − ( 1 − 0.90 ) 2 = 1 − ( 0.10 ) 2 = 0.990000 R_{A,\text{par}} = 1 - (1 - R_A)^2 = 1 - (1 - 0.90)^2 = 1 - (0.10)^2 = 0.990000 R A , par = 1 − ( 1 − R A ) 2 = 1 − ( 1 − 0.90 ) 2 = 1 − ( 0.10 ) 2 = 0.990000
Stage B parallel reliability: R B , par = 1 − ( 1 − R B ) 2 = 1 − ( 1 − 0.85 ) 2 = 1 − ( 0.15 ) 2 = 1 − 0.0225 = 0.977500 R_{B,\text{par}} = 1 - (1 - R_B)^2 = 1 - (1 - 0.85)^2 = 1 - (0.15)^2 = 1 - 0.0225 = 0.977500 R B , par = 1 − ( 1 − R B ) 2 = 1 − ( 1 − 0.85 ) 2 = 1 − ( 0.15 ) 2 = 1 − 0.0225 = 0.977500
Overall system reliability: R arch3 = R A , par × R B , par = ( 0.990000 ) ( 0.977500 ) = 0.967725 ⟹ 96.77 % R_{\text{arch3}} = R_{A,\text{par}} \times R_{B,\text{par}} = (0.990000)(0.977500) = 0.967725 \implies 96.77\% R arch3 = R A , par × R B , par = ( 0.990000 ) ( 0.977500 ) = 0.967725 ⟹ 96.77%
Reliability Differential ( R comp − R sys R_{\text{comp}} - R_{\text{sys}} R comp − R sys ): Δ R = 0.967725 − 0.944775 = 0.022950 ⟹ + 2.30 % \Delta R = 0.967725 - 0.944775 = 0.022950 \implies +2.30\% Δ R = 0.967725 − 0.944775 = 0.022950 ⟹ + 2.30% Using our derived algebraic formula: 2 R A R B ( 1 − R A ) ( 1 − R B ) = 2 ( 0.90 ) ( 0.85 ) ( 0.10 ) ( 0.15 ) = 2 ( 0.765 ) ( 0.015 ) = 0.022950 2 R_A R_B (1 - R_A)(1 - R_B) = 2(0.90)(0.85)(0.10)(0.15) = 2(0.765)(0.015) = 0.022950 2 R A R B ( 1 − R A ) ( 1 − R B ) = 2 ( 0.90 ) ( 0.85 ) ( 0.10 ) ( 0.15 ) = 2 ( 0.765 ) ( 0.015 ) = 0.022950 The calculated delta matches the analytical identity with 100% precision. Unreliability drops from 5.52 % 5.52\% 5.52% to 3.23 % 3.23\% 3.23% , representing a 41.5 % 41.5\% 41.5% reduction in probability of system failure .
Architecture 4: Cold Standby Subsystem
Operating product for Stage A: λ A t = ( 1.0 × 10 − 3 hr − 1 ) ( 200 hr ) = 0.200 \lambda_A t = (1.0 \times 10^{-3}\text{ hr}^{-1})(200\text{ hr}) = 0.200 λ A t = ( 1.0 × 1 0 − 3 hr − 1 ) ( 200 hr ) = 0.200
Stage A cold standby reliability: R A , cold ( 200 ) = e − λ A t ( 1 + λ A t ) = e − 0.200 ( 1 + 0.200 ) = ( 0.818731 ) ( 1.200 ) = 0.982477 R_{A,\text{cold}}(200) = e^{-\lambda_A t}(1 + \lambda_A t) = e^{-0.200}(1 + 0.200) = (0.818731)(1.200) = 0.982477 R A , cold ( 200 ) = e − λ A t ( 1 + λ A t ) = e − 0.200 ( 1 + 0.200 ) = ( 0.818731 ) ( 1.200 ) = 0.982477 (Note: An active parallel pair of identical units would achieve only 1 − ( 1 − 0.818731 ) 2 = 0.967140 1 - (1 - 0.818731)^2 = 0.967140 1 − ( 1 − 0.818731 ) 2 = 0.967140 ) .
Overall Architecture 4 reliability (Stage A cold standby in series with single Stage B valve): R arch4 = R A , cold × R B = ( 0.982477 ) ( 0.850000 ) = 0.835105 ⟹ 83.51 % R_{\text{arch4}} = R_{A,\text{cold}} \times R_B = (0.982477)(0.850000) = 0.835105 \implies 83.51\% R arch4 = R A , cold × R B = ( 0.982477 ) ( 0.850000 ) = 0.835105 ⟹ 83.51%
Architectural Summary Table
Architecture Configuration Description System Reliability R s R_s R s System Unreliability F s F_s F s Risk Reduction vs. Baseline
Arch 1 Baseline Series ( A − B A - B A − B ) 76.50% 23.50% Reference Baseline
Arch 2 System-Level Redundancy ( [ A − B ] ∥ [ A − B ] [A-B] \parallel [A-B] [ A − B ] ∥ [ A − B ] ) 94.48% 5.52% 76.5% reduction in failure risk
Arch 3 Component-Level Redundancy ( [ A ∥ A ] − [ B ∥ B ] [A \parallel A] - [B \parallel B] [ A ∥ A ] − [ B ∥ B ] ) 96.77% 3.23% 86.3% reduction in failure risk
Arch 4 Cold Standby ( A cold − B A_{\text{cold}} - B A cold − B ) 83.51% 16.49% 29.8% reduction in failure risk