Bypassing BDD Construction for Reliability Analysis

Poul Frederick Williams, Macha Nikolskaia, Antoine Rauzy

    Research output: Contribution to journalJournal articlepeer-review

    Abstract

    In this note, we propose a Boolean Expression Diagram (BED)-based algorithm to compute the minimal p-cuts of boolean reliability models such as fault trees. BEDs make it possible to bypass the Binary Decision Diagram (BDD) construction, which is the main cost of fault tree assessment.
    Original languageEnglish
    JournalInformation Processing Letters
    Volume75
    Issue number1-2
    Pages (from-to)85-89
    ISSN0020-0190
    Publication statusPublished - 2000

    Cite this