caa a22 4500 467921261 CHVBK 20180406152917.0 cr unu---uuuuu 170328e20060201xx s 000 0 eng 10.1007/s10836-006-6222-1 doi (NATIONALLICENCE)springer-10.1007/s10836-006-6222-1 Vaaje Audhild Faculty of Engineering and Science, Agder University College, Agder aut Theorems for Fault Collapsing in Combinational Circuits [Elektronische Daten] [Audhild Vaaje] This paper gives a mathematical approach to fault collapsing based on the stuck-at fault model for combinational circuits. The mathematical structure we work within is a Boolean ring of Boolean functions of several variables. The goal of fault collapsing for a given circuit is to reduce the number of stuck-at faults to be considered in test generation and fault diagnosis. For this purpose we need rules that let us eliminate faults from the considered fault set. In this paper some earlier known rules are proved in the new context, and several new rules are presented and proved. The most important of the new theorems deal with the relationship between stuck-at faults on a fanout stem and the branches. The concept of monotony of Boolean functions appears to be important in most of these new rules. Springer Science + Business Media, Inc, 2006 Boolean function nationallicence combinational circuit nationallicence fault collapsing nationallicence monotonic function nationallicence Journal of Electronic Testing Kluwer Academic Publishers 22/1(2006-02-01), 23-36 0923-8174 22:1<23 2006 22 10836 https://doi.org/10.1007/s10836-006-6222-1 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s10836-006-6222-1 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Vaaje Audhild Faculty of Engineering and Science, Agder University College, Agder aut NATIONALLICENCE 773 0- Journal of Electronic Testing Kluwer Academic Publishers 22/1(2006-02-01), 23-36 0923-8174 22:1<23 2006 22 10836 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer