Skip to main content
SpringerLink
Log in

Binary Decision Diagram

  • Chapter
  • First Online:
Assessment of Power System Reliability

Abstract

A binary decision diagram is a directed acyclic graph that consists of nodes and edges. It deals with Boolean functions. A binary decision diagram consists of a set of decision nodes, starting at the root node at the top of the decision diagram. Each decision node contains two outgoing branches, one is a high branch and the other is a low branch. These branches may be represented as solid and dotted lines, respectively. The binary decision diagram contains high and low branches that are used to connect decision nodes with each other to create decision paths. The high and low branches of the final decision nodes are connected to either a high- or low-terminal node, which represents the output of the function. The development of examples of binary decision diagrams is presented in text and in figures. Shannon decomposition is explained. The conversion of a fault tree to a binary decision diagram is shown.

It is a truth very certain that when it is not in our power to determine what is true, we ought to follow what is most probable

Rene Descartes

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Lee CY (1959) Representation of switching functions by binary decision programs. Bell Syst Tech J 38:985?999

    Article  Google Scholar 

  2. Akers SB (1978) Binary decision diagrams. IEEE Trans Comput c-27(6):509?516

    Article  MATH  Google Scholar 

  3. Rushdi AM (1983) Symbolic reliability analysis with the aid of variable-entered Karnaugh maps. IEEE Trans Reliab R32(2):134?139

    Article  Google Scholar 

  4. Bryant RE (1986) Graph based algorithms for Boolean function manipulation. IEEE Trans Comput c-35(8):677?691

    Article  Google Scholar 

  5. Meinel C, Theobald T (1998) Algorithms and data structures in VLSI design: OBDD-foundations and applications. Springer, New York

    Book  Google Scholar 

  6. Zhong J, Tong J, He Z (2010) An approach to use BDD during the fault tree editing and analyzing. In: Proceedings of the eight international conference on probabilistic safety assessment and management (PSAM)

    Google Scholar 

  7. Towhidi F, Lashkari A, Hosseini R (2009) Binary decision diagram (BDD). In: International conference on future computer and communication

    Google Scholar 

  8. Andersen HR (1999) An introduction to binary decision diagrams. Lecture notes for efficient algorithms and programs, IT University of Copenhagen

    Google Scholar 

  9. Lafferty J, Vardy A (1998) Ordered binary decision diagrams and minimal trellises CMU-CS-98?162. School of Computer Science Carnegie Mellon University, Pittsburgh

    Google Scholar 

  10. Vesely W, Dugan J, Fragola J et al (2002) Fault tree handbook with aerospace applications. National Aeronautics and Space Administration

    Google Scholar 

  11. Way YS, Hsia DY (2000) A simple component-connection method for building binary decision diagrams encoding a fault tree. Rel Eng Syst Saf 70:59?70

    Article  Google Scholar 

  12. Bartlett LM, Andrews JD (2001) An ordering heuristic to develop the binary decision diagram based on structural importance. Rel Eng Syst Saf 72:31?38

    Article  Google Scholar 

  13. Reay KA, Andrews JD (2002) A fault tree analysis strategy using binary decision diagrams. Rel Eng Syst Saf 78:45?56

    Article  Google Scholar 

  14. Bollig B, Wegener I (1999) Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams. Theory Comp Syst 32:487?503

    Article  MathSciNet  MATH  Google Scholar 

  15. Bishop CM (1995) Neural networks for pattern recognition. Clarendon, Oxford

    Google Scholar 

  16. Lhotak O (2006) Program analysis using binary decision diagrams. PhD thesis, McGill University

    Google Scholar 

  17. Lind-Nielsen J (2004) BuDDy: a binary decision diagram package

    Google Scholar 

  18. Whaley J (2007) Context-sensitive pointer analysis using binary decision diagrams. PhD thesis, Stanford University

    Google Scholar 

  19. Dutuit Y, Rauzy A (1999) A guided tour of minimal cutsets handling by means of binary decision diagrams. In: Proceedings of the probabilistic safety assessment conference, PSA’99, ANS, pp 55?62

    Google Scholar 

  20. Nusbaumer OPM (2007) Analytical solutions of linked fault tree probabilistic risk assessments using binary decision diagrams with emphasis on nuclear safety applications, Swiss Federal Institute of Technology Zurich

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Electrical Engineering, University of Ljubljana, Trzaska 25, 1000, Ljubljana, Slovenia

    Marko Čepin

Authors
  1. Marko Čepin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marko Čepin .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag London Limited

About this chapter

Cite this chapter

Čepin, M. (2011). Binary Decision Diagram. In: Assessment of Power System Reliability. Springer, London. https://doi.org/10.1007/978-0-85729-688-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-0-85729-688-7_7

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-0-85729-687-0

  • Online ISBN: 978-0-85729-688-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation