Boolean functions with engineering applications and computer programs
Boolean functions with engineering applications and computer programs
Analysis of Noncoherent Systems and an Architecture for the Computation of the System Reliability
IEEE Transactions on Computers
An Investigation of the Laws of Thought
An Investigation of the Laws of Thought
On the Polynomial Form of Boolean Functions: Derivations and Applications
IEEE Transactions on Computers
Static Monotonicity Analysis for lambda-definable Functions over Lattices
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Static extensivity analysis for λ-definable functions over lattices
New Generation Computing
| Hi-index | 14.98 |
It is shown how the property of being monotonous of any n-variables 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.