This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Necessary and Sufficient Criterion for the Monotonicity of Boolean Functions with Deterministic and Stochastic Applications
November 1996 (vol. 45 no. 11)
pp. 1300-1302

Abstract—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.

[1] S. Akers, "On a Theory of Boolean Functions," SIAM J., vol. 7, pp. 487-498. 1959.
[2] W.G. Schneeweiss, Boolean Functions with Engineering Applications and Computer Programs, chapter 7. New York: Springer-Verlag, 1989.
[3] G. Boole, The Laws of Thought.London: McMillan, 1854. Reprint: New York: Dover, 1958.
[4] E. Henley and H. Kumamoto, Probabilistic Risk Assessment.New York: IEEE Press, 1991 (reprint from 1981).
[5] S. Upadhyaya and H. Pham, "Analysis of Non-Coherent Systems and an Architecture for the Computation of the System Reliability," IEEE Trans. Computers, vol. 42, pp. 484-493, 1993.
[6] W. Schneeweiss, "SyRePa'89, A Package of Programs for Systems Reliability Evaluation," Informatik-Bericht (Technical Report) 91 (8/1991). Hagen: Fern Universität (available from the author).

Index Terms:
Boolean function, switching function, monotonicity, noncoherent system, sensitivity analysis.
Citation:
Winfrid G. Schneeweiss, "A Necessary and Sufficient Criterion for the Monotonicity of Boolean Functions with Deterministic and Stochastic Applications," IEEE Transactions on Computers, vol. 45, no. 11, pp. 1300-1302, Nov. 1996, doi:10.1109/12.544486
Usage of this product signifies your acceptance of the Terms of Use.