Improving reliability calculation with augmented binary decision diagrams
The Augmented Ordered Binary Decision Diagram (OBDD-A) has been shown to be extremely efficient for reliability calculations, especially when combined with the Boundary Set method of partition representation. The existing OBDD-A follows the Boundary Set method closely, requiring the calculation of p...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
IEEE Computer Society
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/31674 |
| _version_ | 1848753447295254528 |
|---|---|
| author | Herrmann, Johannes u |
| author2 | Lisa O'Connor |
| author_facet | Lisa O'Connor Herrmann, Johannes u |
| author_sort | Herrmann, Johannes u |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | The Augmented Ordered Binary Decision Diagram (OBDD-A) has been shown to be extremely efficient for reliability calculations, especially when combined with the Boundary Set method of partition representation. The existing OBDD-A follows the Boundary Set method closely, requiring the calculation of partition numbers large enough to exceed the capacity of native storage types in languages such as C++. By omitting the use of partition numbers the execution speed of the algorithm is increased, while the low memory usage of an OBDD-A is maintained. We compare the new OBDD-A to the existing version on a number of networks, showing that processing time for large networks increases significantly. |
| first_indexed | 2025-11-14T08:24:39Z |
| format | Conference Paper |
| id | curtin-20.500.11937-31674 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T08:24:39Z |
| publishDate | 2010 |
| publisher | IEEE Computer Society |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-316742017-01-30T13:26:48Z Improving reliability calculation with augmented binary decision diagrams Herrmann, Johannes u Lisa O'Connor space efficient network reliability binary decision diagram all-terminal reliability Kterminal reliability The Augmented Ordered Binary Decision Diagram (OBDD-A) has been shown to be extremely efficient for reliability calculations, especially when combined with the Boundary Set method of partition representation. The existing OBDD-A follows the Boundary Set method closely, requiring the calculation of partition numbers large enough to exceed the capacity of native storage types in languages such as C++. By omitting the use of partition numbers the execution speed of the algorithm is increased, while the low memory usage of an OBDD-A is maintained. We compare the new OBDD-A to the existing version on a number of networks, showing that processing time for large networks increases significantly. 2010 Conference Paper http://hdl.handle.net/20.500.11937/31674 IEEE Computer Society fulltext |
| spellingShingle | space efficient network reliability binary decision diagram all-terminal reliability Kterminal reliability Herrmann, Johannes u Improving reliability calculation with augmented binary decision diagrams |
| title | Improving reliability calculation with augmented binary decision diagrams |
| title_full | Improving reliability calculation with augmented binary decision diagrams |
| title_fullStr | Improving reliability calculation with augmented binary decision diagrams |
| title_full_unstemmed | Improving reliability calculation with augmented binary decision diagrams |
| title_short | Improving reliability calculation with augmented binary decision diagrams |
| title_sort | improving reliability calculation with augmented binary decision diagrams |
| topic | space efficient network reliability binary decision diagram all-terminal reliability Kterminal reliability |
| url | http://hdl.handle.net/20.500.11937/31674 |