Bypassing BDD Construction for Reliability Analysis

Poul F. Williams
Macha Nikolskaia
Antoine Rauzy

July 2000

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.

In Information Processing Letters (IPL), volume 75, issue 1-2, July 2000. 2000 Elsevier.

Available as PostScript(gzip'ed), PostScript, PDF, and BibTeX.

Poul Frederick Williams

E-mail: pfw@it-c.dk

Homepage: www.it-c.dk/people/pfw