A necessary and sufficient criterion for the monotonicity of Boolean functions with deterministic and stochastic applications

It is shown how the property of being monotonous of any invariables combinational switching function can be checked by evaluating n possibly ternary functions of binary variables in a simple way. Those functions are then shown to play a key role in the sensitivity analysis of stochastic Boolean functions.