A weighted tree model for algorithms with Boolean vector operands

Algorithms for fault tolerance decisions e.g., reconfiguration, deciding that a system is faulty, etc., frequently use operations with operands which are Boolean vectors. The bits in these vectors may represent, for example that a process or processor is up or down. Four common types of operations present in these algorithms are AND, OR, BMV (Boolean majority voting), and MASK. The authors show that by using the concept of weight of an operand, one can evaluate the structure of this type of algorithm with respect to how trustworthy their decisions are or evaluate the effect of a given input operand.<>