V. C. Prasad

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 of(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)
It has been shown that when binary decision diagrams (HDDs) are formed from uniformly distributed random Boolean functions (BFs), the average number of nodes in the BDDs is in a simple relation to the number of variables and terms in the BFs. In the present work, the node counts for BBDs formed from ISCAS benchmark circuits are examined and compared to the(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)
For an equation o-f the -form £<&.>••¥., it is shown that there is at least one solution •for every y_ if F_ is eventually PB passive or the e-f-fective Jacobian matrix in all the unbounded regions is a P matrix. In addition to this, i-f the Jacobian determinant has the same sign in all the regions, then F is a homeomorphism. For equations o-f the form(More)