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 language | English |
|---|---|
| Journal | Information Processing Letters |
| Volume | 75 |
| Issue number | 1-2 |
| Pages (from-to) | 85-89 |
| ISSN | 0020-0190 |
| Publication status | Published - 2000 |