Fast fault-tree evaluation for many sets of input data

It is pointed out that system unavailability and failure frequency can be found for many sets of components data via symbolic formulas with few multiplications. The derivation of such symbolic formulas is possible by binary-tree algorithms (specifically the Shannon expansion) which could run very fast on supercomputers allowing for binary-tree parallelism. The reduction factor of the number of multiplications needed in nested versus polynomial forms is roughly half the height of the decomposition tree, and the height of the tree is roughly the number of system components