Learn More
—In this paper, selection of test nodes has been studied extensively and efficient techniques are proposed. Two broad categories of methods called inclusion methods and exclusion methods are suggested. Strategies are presented to select or delete a test node without affecting the diagnosis capabilities. Examples show that these strategies give less number(More)
Whenever a fault occurs in a particular section of a distribution network and on isolation of the fault some of the loads get disconnected and are left unsupplied. Service should be restored to these affected load points as quickly as possible through a network reconfiguration procedure. A new and efficient technique is presented in this paper for this(More)
This paper describes a mathematical model for the prediction of binary decision diagram (BDD) depth measures, such as the longest path length (LPL) and the average path length (APL). The formal core of the model is a formula for the average LPL and APL over the set of BDD derived from Boolean logic expressions with a given number of variables and product(More)
Binary Decision Diagrams (BDDs) are the most frequently used data structure for handling Boolean functions because of their excellent efficiency in terms of time and space. Algebraic Decision Diagrams (ADDs) have been used to solve general purpose problems such as Matrix Multiplication, logic synthesis and Formal Verification. We propose a new type of BDD(More)