Boolean functions with engineering applications and computer programs
Boolean functions with engineering applications and computer programs
n-tuples of 0s and 1s: necessary and sufficient conditions for intrinsic order
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
A picture for complex stochastic boolean systems: the intrinsic order graph
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
A new algorithm for complex stochastic boolean systems
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
| Hi-index | 0.00 |
A new method is proposed to select the binary n-tuples of 0s and 1s by decreasing order of there occurrence probabilities in stochastic Boolean models. This method can be applied to evaluate fault trees in Reliability Engineering and Risk Analysis, as well as to many other problems described by a stochastic Boolean structure. The selecting criterion is exclusively based on the positions of 0s and 1s in the binary n-tuples. In this way, the computational cost in sorting algorithms is drastically reduced, because the proposed criterion is independent of the probabilities of the Boolean variables. Every step, the algorithm extends the set of selected binary states, obtaining the binary n-tuples just by adding 0 (1) at the end of all the (some) previously selected binary n - 1-tuples.