Skip to main content

Research Repository

Advanced Search

An efficient algorithm for exact computation of system and survival signatures using binary decision diagrams

Reed, Sean

An efficient algorithm for exact computation of system and survival signatures using binary decision diagrams Thumbnail


Authors

Sean Reed



Abstract

System and survival signatures are important and popular tools for studying and analysing the reliability of systems. However, it is difficult to compute these signatures for systems with complex reliability structure functions and large numbers of components. This paper presents a new algorithm that is able to compute exact signatures for systems that are far more complex than is feasible using existing approaches. This is based on the use of reduced order binary decision diagrams (ROBDDs), multidimensional arrays and the dynamic programming paradigm. Results comparing the computational efficiency of deriving signatures for some example systems (including complex benchmark systems from the literature) using the new algorithm and a comparison enumerative algorithm are presented and demonstrate a significant reduction in computation time and improvement in scalability with increasing system complexity.

Journal Article Type Article
Acceptance Date Mar 20, 2017
Online Publication Date Apr 9, 2017
Deposit Date Apr 25, 2017
Publicly Available Date Apr 25, 2017
Journal Reliability Engineering & System Safety
Electronic ISSN 0951-8320
Publisher Elsevier
Peer Reviewed Peer Reviewed
Volume 165
DOI https://doi.org/10.1016/j.ress.2017.03.036
Keywords System signature; Survival signature; Binary decision diagram; System reliability
Public URL https://nottingham-repository.worktribe.com/output/855308
Publisher URL http://www.sciencedirect.com/science/article/pii/S095183201630120X

Files





Downloadable Citations