Add Fault Tree Analysis as the companion model to RBDs: AND / OR / k-of-n (VOTE) gates, minimal cut sets, top-event probability, and RBD↔FTA conversion.
Reuses the existing cut-set (Berge's algorithm) and exact Shannon-decomposition engine, so much of the machinery is already in place.
Estimate
Effort: L (~1–2 weeks) · Value: High
A whole companion modelling paradigm (new gate types, a top-event API, and both conversion directions), but it reuses the existing cut-set (Berge) and Shannon engine, which removes most of the algorithmic risk. FTA addresses a large safety/PRA audience, and pairing it with RBD + conversion is a strong differentiator — worth scheduling deliberately rather than opportunistically.
Add Fault Tree Analysis as the companion model to RBDs: AND / OR / k-of-n (VOTE) gates, minimal cut sets, top-event probability, and RBD↔FTA conversion.
Reuses the existing cut-set (Berge's algorithm) and exact Shannon-decomposition engine, so much of the machinery is already in place.
Estimate
Effort: L (~1–2 weeks) · Value: High
A whole companion modelling paradigm (new gate types, a top-event API, and both conversion directions), but it reuses the existing cut-set (Berge) and Shannon engine, which removes most of the algorithmic risk. FTA addresses a large safety/PRA audience, and pairing it with RBD + conversion is a strong differentiator — worth scheduling deliberately rather than opportunistically.