论文部分内容阅读
A new strategy of finding the best set of tear streams is proposed in this paper.It includes lining upall the nodes of the net in the declining order of node weights,and then adjusting the node positions in thesequence such that the total weights of the counter streams minimilcd.The finally formed node sequenceindicates the computation order of the nodes,and the still existing counter streams constitute the tear set.Neither loop identification nor excessive matrix operations are needed in this procedure;therefore,it hasbeen the simplest reliable method of net decomposition to data,and this is demonstrated by seven well-knownexamples.
A new strategy of finding the best set of tear streams is proposed in this paper. It includes lining upall the nodes of the net in the declining order of node weights, and then adjusting the node positions in thesequence such that the total weights of the counter streams minimilcd. The finally formed node sequenceindicates the computation order of the nodes, and the still existing counter streams constitute the tear set. Neither loop identification nor excessive matrix operations are needed in this procedure; therefore, it has bound the simplest reliable method of net decomposition to data, and this is demonstrated by seven well-knownexamples.