BDD complexity reduction by Component Fault Trees

Advances in Safety and Reliability - Proceedings of the European Safety and Reliability Conference, ESREL 2005

Volumn 1, Issue , 2005, Pages 1011-1019

  Kaiser, B ^a   Zocher, A ^b  

^a FRAUNHOFER IESE   (Germany)

^b UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY REDUCTION; COMPONENT ARCHITECTURES; COMPONENT FAULT TREES; CRITICAL SYSTEMS; FAULT-TREES; INPUT AND OUTPUTS; OPTIMISATIONS; ORDERING ALGORITHMS; VARIABLE ORDER;

BINARY DECISION DIAGRAMS; OPTIMIZATION; PROFITABILITY; RELIABILITY;

FORESTRY;

EID: 79952027975     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. Bollig, B. & Wegener, I. (1996).: Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. on Comp., 45(9):993-1002, 1996.
2. Bryant, R.E. (1986): Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, Aug. 1986.
3. ESSaRel (2004) Embedded Safety and Reliability Analyser. Project Homepage www.essarel.de.
4. IEC 61025 (1990). International Standard IEC 61025 Fault Tree Analysis. International Electrotechnical Commission. Geneva.
5. Kaiser, B., Liggesmeyer, P. & Mäckel, O. (2004). A New Component Concept for Fault Trees. In Proc., Canberra, Australia. Conferences in Research and Practice in InformationTechnology, 33. Lindsay, P. and Cant,T., Eds.,ACS. 37-46.
6. Rudell, R. (1993): Dynamic variable ordering for ordered binary decision diagrams. In 1993 IEEE/ACM international conference on Computer-aided design: ICCAD'93, pages 42-47. 1993.
7. Vesely, W.E., Goldberg, F.F., Roberts, N.H. & Haasl, D.F. (1981): Fault Tree Handbook. U. S. Nuclear Regulatory Commission, NUREG-0492,Washington DC.
8. SciMark, Homepage http://math.nist.gov/scimark2/.