Skip to main content
SpringerLink
Log in

A New Algorithm for Complex Stochastic Boolean Systems

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3980))

Included in the following conference series:

Abstract

Many different complex systems depend on a large number n of mutually independent random Boolean variables. For these systems, each one of the 2n possible situations is described by its corresponding binary n-tuple, (u 1,...,u n ) , of 0s and 1s, and it has its own occurrence probability Pr{(u 1,...,u n )}. In this context, this paper provides a simple algorithm for rapidly generating all the binary n-tuples of 0s and 1s whose occurrence probabilities are always greater than or equal to (less than or equal to) the occurrence probability Pr{(u 1,...,u n )} of an arbitrary fixed binary n-tuple (u 1,...,u n ) ∈ {0,1}n. The results can be applied to many stochastic Boolean phenomena related to any scientific, technical or social area. All required previous results are described in detail, so that the presentation is self-contained.

Partially supported by MEC (Spain) and FEDER. Grant contract: CGL2004-06171-C03-02/CLI.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. González, L.: A new method for ordering binary states probabilities in Reliability and Risk Analysis. In: Sloot, P.M.A., Tan, C.J.K., Dongarra, J., Hoekstra, A.G. (eds.) ICCS-ComputSci 2002, part 1. LNCS, vol. 2329, pp. 137–146. Springer, Heidelberg (2002)

    Google Scholar 

  2. González, L.: N-tuples of 0s and 1s: Necessary and sufficient conditions for intrinsic order. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds.) ICCSA 2003, part 1. LNCS, vol. 2667, pp. 937–946. Springer, Heidelberg (2003)

    Google Scholar 

  3. González, L., Galván, B., García, D.: Sobre el análisis computacional de funciones Booleanas estocásticas de muchas variables. In: González, L., Sendra, J.R. (eds.) Proc. Primer Encuentro de Álgebra Computacional y Aplicaciones (EACA 1995), Santander, pp. 45–55 (1995)

    Google Scholar 

  4. González, L., García, D., Galván, B.J.: An intrinsic order criterion to evaluate large, complex fault trees. IEEE Trans. Reliability 53(3), 297–305 (2004)

    Article  Google Scholar 

  5. National Aeronautics and Space Administration: Fault Tree Analysis: A Bibliography. Technical report NASA/SP–2000-6111 (2000)

    Google Scholar 

  6. Schneeweiss, W.G.: Boolean Functions with Engineering Applications and Computer Programs. Springer, Berlin (1989)

    MATH  Google Scholar 

  7. Stanley, R.P.: Enumerative Combinatorics, vol. 1. Cambridge University Press, Cambridge (1997)

    MATH  Google Scholar 

  8. Stuart, A., Ord, J.K.: Kendall’s Advanced Theory of Statistics. In: Distribution Theory, vol. 1. Oxford University Press, New York (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Research Institute IUSIANI, University of Las Palmas de Gran Canaria, 35017, Las Palmas de Gran Canaria, Spain

    Luis González

Authors
  1. Luis González
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

González, L. (2006). A New Algorithm for Complex Stochastic Boolean Systems. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751540_67

Download citation

  • DOI: https://doi.org/10.1007/11751540_67

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34070-6

  • Online ISBN: 978-3-540-34071-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation