In this paper we study empirically the behavior of algorithm structure-based abduction (SAB) which was developed in the framework of constraint networks [5], by comparing it with a model-based diagnosis algorithm MBD, simialr to algorithm GDE [3]. The distinguishing features of algorithm SAB are that it exploits the structure of the constraint network and that it is most efficient when the problem contains no cycles. The performance of both algorithms is tested on a family of parametrized acyclic combinational circuits for the task of finding all minmal-cardinality diagnoses. The results show that due to its exponential complexity for large circuits MBD can run out of space and time, while SAB is able to compute the diagnoses for those same circuits. Unlike MBD, SAB appears to be insensitive to variations in the circuit types and input probabilities. For small circuits, the average time for MBD relative to SAB seems to be proportional to the number of conflicts relative to the number of diagnoses.