Skip to main content

Abstract

For a qualitatively and quantitatively analysis of a complex Decision Making (DM) process is critical to employ a correct method due to the large number of operations required. This paper presents an approach employing Binary Decision Diagram (BDD) applied to the Logical Decision Tree. LDT allows addressing a Main Problem (MP) by establishing different causes, called Basic Causes (BC) and their interrelations. The cases that have a large number of BCs generate important computational costs because it is a NP-hard type problem. This paper presents a new approach in order to analyze big LDT. A new approach to reduce the complexity of the problem is hereby presented. It makes use of data derived from simpler problems that requires less computational costs for obtaining a good solution. An exact solution is not provided by this method but the approximations achieved have a low deviation from the exact.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.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. Akers S (1978) Binary decision diagrams. IEEE Trans Comput 27:509–516

    Article  Google Scholar 

  2. Artigao E (2009) Análisis de árboles de fallos mediante diagramas de decisión binarios. PFC Universidad de Castilla La Mancha

    Google Scholar 

  3. Bartlett L (2003) Progression of the binary decision diagram conversion methods. In: Proceedings of the 21st international system safety conference, vol 48. Ottawa, Westin Hotel, pp 116–25

    Google Scholar 

  4. Bartlett L, Andrews J (2001) An ordering heuristic to develop the binary decision diagram based on structural importance. Reliab Eng Syst Saf 72:31–38

    Article  Google Scholar 

  5. Bryant R (1986) Graph-based algorithms for Boolean functions using a graphical representation. IEEE Trans Comput 35:677–691

    Article  Google Scholar 

  6. Cormen T, Leiserson CE, Rivest RL (2001) Introduction to algorithms. MIT Press and McGraw-Hill, New York, pp 540–549

    Google Scholar 

  7. Ericson C (1999) Fault tree analysis: a history. In: Proceedings of the 17th international safety systems conference

    Google Scholar 

  8. García Márquez F, H M (2012) Introduccián análisis de Á rboles de fallos: Empleo de bdds. Editorial Académica Española

    Google Scholar 

  9. Jensen R, Veloso M (2000) OBDD-based universal planning for synchronized agents in non-deterministic domains. J Artif Intell Res 13:189–226

    Google Scholar 

  10. Lee CY (1959) Representation of switching circuits by binary decision diagrams. Bell Syst Technol 38:985–999

    Article  Google Scholar 

  11. Lopez D, Van Slyke WJ (1977) Logic tree analysis for decision making. Omega Int J Manag Sci 5:614–617

    Article  Google Scholar 

  12. Malik S (1988) Logic verification using binary decision diagrams in logic synthesis environment. In: Proceedings of the IEEE international conference on computer aided design, pp 6–9

    Google Scholar 

  13. Mallo C, Merlo J (1995) Control de gestión y control presupuestario. McGraw-Hill, New York, pp 5–30

    Google Scholar 

  14. Minato S, Ishiura N, Yajim S (1990) Shared binary decision diagrams with attributed edges for efficient boolean function manipulation. In: Proceedings of the 27th ACM/IEEE design automation conference, pp 52–57

    Google Scholar 

  15. Moret B (1982) Decision trees and diagrams. Comput Surv 14:413–416

    Article  Google Scholar 

  16. Rauzy A (1993) New algorithms for fault trees analysis. Reliab Eng Syst Saf 5:203–211

    Article  Google Scholar 

  17. Xie M, Tan K, Goh K (2000) Optimum prioritisation and resource allocation based on fault tree analysis. Int J Qual Reliab Manag 17:189–199

    Article  Google Scholar 

Download references

Acknowledgments

The work reported herewith has been financially supported by the Spanish Ministerio de Economía y Competitividad, under Research Grant DPI2012-31579.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alberto Pliego Marugán .

Editor information

Editors and Affiliations

Appendix

Appendix

See Fig. 9

Fig. 9
figure 9

Annex 1

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marugán, A.P., Márquez, F.P.G. (2015). Improving the Efficiency on Decision Making Process via BDD. In: Xu, J., Nickel, S., Machado, V., Hajiyev, A. (eds) Proceedings of the Ninth International Conference on Management Science and Engineering Management. Advances in Intelligent Systems and Computing, vol 362. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47241-5_116

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47241-5_116

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47240-8

  • Online ISBN: 978-3-662-47241-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics