A Method for Finding Prime Implicants in Incoherent Fault Trees by Use of Commonly Available Tools for Minimal Cut Set Analysis in Coherent Fault Trees

  • Peter Puhr-Westerheide
Conference paper


This paper outlines a method to find the prime implicants of incoherent fault trees using a fault tree transformation and commonly available tools for the analysis of minimal cut sets of coherent fault trees, and by post processing the results.


Boolean Function Basic Event Fault Tree Binary Decision Diagram Binary Signal 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Veitch, E. W. (1952), A chart method for simplifying truth functions, May 1952 in Proc. Assoc. for Computing Machinery, Pittsburgh.Google Scholar
  2. 2.
    Karnaugh, M. (1953), The map method for synthesis of combinational logic circuit, Nov 1953 in Trans. AIEE Communications and Electronics. 72, S.593–599MathSciNetGoogle Scholar
  3. 3.
    McCluskey, E. J. (1956), Minimisation of boolean Functions, 1956 in Bell System technical Journal. S. 1417–1444Google Scholar
  4. 4.
    Quine, W. V. O. (1959), On cores and prime implicants of truth functions, Nov. 1959 in American Mathematical Monthly 66: No. 9, S.755–760 Lancaster PA., ISSN 0002-9890CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Chandra, A., Markowsky, G. (1978), On the number of prime implicants. Discrete Mathematics 24: 7–11 (1978)CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Garey, M., Johnson, D. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San FranciscoMATHGoogle Scholar
  7. 7.
    Bryant, R. E. (1982), Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams, ACM Computing Surveys, Vol. 24, No. 3 (September, 1992), pp. 293–318.CrossRefGoogle Scholar
  8. 8.
    Sedgewick, R. (1992), Algorithms in C++, Addison-Wesley, Reading MA (1992)Google Scholar
  9. 9.
    Contini, S., de Cola, G. (1996), A Top Down Approach to Fault Tree Analysis Using Binary Decision Diagrams, European Journal of Automation, 30(8), 1996Google Scholar
  10. 10.
    Hayase, K., Imai, H. (1998), OBDDs of a Monotone Function and Its Prime Implicants, Theory Comput. Systems 31: 579–591 (1998) by Springer-Verlag New YorkCrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    Hayes, B. (1997), Computing Science Can’t Get No Satisfaction, American Scientist the magazine of Sigma X, Vol. 85, No.2 (March-April, 1997), pp. 108–112Google Scholar

Copyright information

© Springer-Verlag London 2004

Authors and Affiliations

  • Peter Puhr-Westerheide
    • 1
  1. 1.Gesellschaft für Anlagen-und Reaktorsicherheit (GRS) mbHGarchingGermany

Personalised recommendations