Analysis of Logic Cirwits with Faults Using Input

Abstract

1:n t h i s paper a method is given f o r c a l c u l a t i n g t h e p r o b a b i l i t y t h a t t he output of a genera l combinational network is 1 given t h e p r o b a b i l i t i e s f o r each i n p u t being 1. We d e f i n e t h e not ions of t h e p r o b a b i l i t y of a s igna l and s i g n a l independence. Then s e v e r a l p r o o f s are given t o show the r e l a t i o n s h i p between boolean opera t ions and a l g e b r a i c o p e r a t i o n upon p r o b a b i l i t i e s . A s a r e s u l t of t h e s e a simple a lgor i thm is presented f o r c a l c u l a t i n g output p r o b a b i l i t i e s . S i m p l i f i c a t i o n s t h a t a r i s e when sets of input p r o b a b i l i t i e s are set t o i d e n t i c a l va lues a r e noted i n a process c a l l e d bundling. 'I!hen a s e r i e s of examples i l l u s t r a t e v a r i o u s techniques f o r handling problems c u r r e n t l y r e l e v a n t t o f a u l t t o l e r a n t computing. ~ -----

Cite this paper

@inproceedings{PAWR2004AnalysisOL, title={Analysis of Logic Cirwits with Faults Using Input}, author={PAWR and Edward J. McCluskey}, year={2004} }