Paper Info
Title
A BDD-Based Algorithm for Analysis of Multistate Systems with Multistate Components
Abstract
Abstract--In this paper, a new algorithm based on Binary Decision Diagram (BDD) for the analysis of a system with multistate components is proposed. Each state of a multistate component is represented by a Boolean variable, and a multistate system is represented by a series of multistate fault trees. A Boolean algebra with restrictions on variables is used to address the dependence among these Boolean variables that collectively represent the same component and a new BDD operation is proposed to realize this Boolean algebra. Due to the nature of the BDD, the sum of disjoint products (SDP) can be implicitly represented, which avoids huge storage and high computational complexity for large multistate systems. Some applications are given to illustrate the use of our new algorithm.
Year
DOI
Venue
2003
10.1109/TC.2003.1252856
IEEE Trans. Computers
Keywords
Field
DocType
multistate system,disjoint product,new bdd operation,binary decision diagram,multistate systems,boolean algebra,large multistate system,new algorithm,boolean variable,bdd-based algorithm,multistate component,multistate components,multistate fault tree,computational complexity,fault tree,fault trees
Disjoint sets,Computer science,Binary decision diagram,Algorithm,Theoretical computer science,Boolean algebra,Fault tree analysis,Boolean data type,Computational complexity theory
Journal
Volume
Issue
ISSN
52
12
0018-9340
Citations 
PageRank 
References 
46
2.95
7
Authors
4
Name
Order
Citations
PageRank
Xinyu Zang11007.06
Dazhi Wang219412.64
Hairong Sun31008.51
Trivedi, K.S.47721700.23