DocumentCode :
3648188
Title :
A BDD-based algorithm for computation of exact fault detection probabilities
Author :
R. Krieger;B. Becker;R. Sinkovic
Author_Institution :
Dept. of Comput. Sci., J.W. Goethe Univ., Frankfurt, Germany
fYear :
1993
Firstpage :
186
Lastpage :
195
Abstract :
Signal and fault detection probabilities are widely used in the area of testing. Due to the computational complexity, in most cases only approximated values are computed. A system called PLATO which allows the computation of the exact values for many combinational circuits is described. The implemented algorithms use the recently developed BDD packages as data structure. Besides the description of the algorithms, attention is given to general problems arising with the use of BDDs as data structure. Some new heuristics are presented to deal with these problems.
Keywords :
"Data structures","Boolean functions","Fault detection","Electrical fault detection","Binary decision diagrams","Signal detection","Circuit testing","Computational complexity","Combinational circuits","Packaging"
Publisher :
ieee
Conference_Titel :
Fault-Tolerant Computing, 1993. FTCS-23. Digest of Papers., The Twenty-Third International Symposium on
ISSN :
0731-3071
Print_ISBN :
0-8186-3680-7
Type :
conf
DOI :
10.1109/FTCS.1993.627322
Filename :
627322
Link To Document :
بازگشت