An example of an irredundant combinational network realizing a Boolean function F0is presented which depicts a peculiar phenomenon that even a single stuck-at fault can change the function F0to a faulty funetion Ff, such that F0and Ffbelong to the same P-equivalence class, i.e., F0can be transformed into Ffby permuting the input literals. In addition, the reversibility of fault behavior in irredundant networks is also exemplified.
Published in:
Proceedings of the IEEE
(Volume:71
,
Issue:
6
)
Date of Publication:
June 1983
- Page(s):
-
779
-
780
- ISSN :
-
0018-9219
- Digital Object Identifier :
-
10.1109/PROC.1983.12669
- Product Type:
-
Journals & Magazines
- Date of Current Version :
-
28 June 2005
- Issue Date :
-
June 1983
- Sponsored by :
-
IEEE