Table of Contents
Journal of Complex Systems
Volume 2014 (2014), Article ID 428418, 9 pages
http://dx.doi.org/10.1155/2014/428418
Research Article

Complex Stochastic Boolean Systems: Comparing Bitstrings with the Same Hamming Weight

Department of Mathematics, Research Institute SIANI, University of Las Palmas de Gran Canaria, Campus de Tafira, 35017 Las Palmas de Gran Canaria, Spain

Received 31 October 2013; Accepted 11 January 2014; Published 24 March 2014

Academic Editor: Chun-Yi Su

Copyright © 2014 Luis González. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. N. D. Singpurwalla, “Foundational issues in reliability and risk analysis,” SIAM Review, vol. 30, no. 2, pp. 264–282, 1988. View at Google Scholar · View at Scopus
  2. T. Bedford and R. M. Cooke, Probabilistic Risk Analysis: Foundations and Methods, Cambridge University Press, Cambridge, UK, 2001.
  3. M. Rausand and A. Hoyland, System Reliability Theory: Models, Statistical Methods and Applications, Wiley-Interscience, New York, NY, USA, 2004.
  4. U. S. Nuclear Regulatory Commission, “Reactor safety study: an assessment of accident risks in U. S. commercial nuclear power plants,” Tech. Rep. NUREG-75/014:WASH-1400, 1975. View at Google Scholar
  5. E. Borgonovo, “The reliability importance of components and prime implicants in coherent and non-coherent systems including total-order interactions,” European Journal of Operational Research, vol. 204, no. 3, pp. 485–495, 2010. View at Publisher · View at Google Scholar · View at Scopus
  6. C. L. Smith, “Calculating conditional core damage probabilities for nuclear power plant operations,” Reliability Engineering and System Safety, vol. 59, no. 3, pp. 299–307, 1998. View at Google Scholar · View at Scopus
  7. L. Gonzalez, “A new method for ordering binary states probabilities in reliability and risk analysis,” in Computational Science—ICCS 2002, vol. 2329 of Lecture Notes in Computer Science, pp. 137–146, 2002. View at Publisher · View at Google Scholar
  8. R. P. Stanley, Enumerative Combinatorics, vol. 1, Cambridge University Press, Cambridge, UK, 1997.
  9. L. González, “A picture for complex stochastic Boolean systems: the intrinsic order graph,” in Computational Science—ICCS 2006, vol. 3993 of Lecture Notes in Computer Science, pp. 305–312, 2006. View at Publisher · View at Google Scholar
  10. L. González, “Duality in complex stochastic Boolean systems,” in Electrical Engineering and Intelligent Systems, S.-I. Ao and L. Gelman, Eds., pp. 15–27, Springer, New York, NY, USA, 2012. View at Google Scholar
  11. L. González, “Algorithm comparing binary string probabilities in complex stochastic Boolean systems using intrinsic order graph,” Advances in Complex Systems, vol. 10, no. 1, pp. 111–143, 2007. View at Google Scholar · View at Scopus
  12. L. Gonzalez, “Edges, chains, shadows, neighbors and subgraphs in the intrinsic order graph,” IAENG International Journal of Applied Mathematics, vol. 42, no. 1, pp. 66–73, 2012. View at Google Scholar
  13. L. Gonzalez, “Intrinsic ordering, combinatorial numbers and reliability engineering,” Applied Mathematical Modelling, vol. 37, no. 6, pp. 3944–3958, 2013. View at Publisher · View at Google Scholar