Titlebook: Integrating Functional and Temporal Domains in Logic Design; The False Path Probl Patrick C. McGeer,Robert K. Brayton Book 1991 Springer Sc

桌前不可入

書目名稱Integrating Functional and Temporal Domains in Logic Design影響因子(影響力)




書目名稱Integrating Functional and Temporal Domains in Logic Design影響因子(影響力)學(xué)科排名




書目名稱Integrating Functional and Temporal Domains in Logic Design網(wǎng)絡(luò)公開度




書目名稱Integrating Functional and Temporal Domains in Logic Design網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Integrating Functional and Temporal Domains in Logic Design被引頻次




書目名稱Integrating Functional and Temporal Domains in Logic Design被引頻次學(xué)科排名




書目名稱Integrating Functional and Temporal Domains in Logic Design年度引用




書目名稱Integrating Functional and Temporal Domains in Logic Design年度引用學(xué)科排名




書目名稱Integrating Functional and Temporal Domains in Logic Design讀者反饋




書目名稱Integrating Functional and Temporal Domains in Logic Design讀者反饋學(xué)科排名

喪失

Book 1991ome existing approaches were wrong, it became apparent that the root of the difficulties lay in the attempts to balance computational efficiency and accuracy by separating the tempo- ral and logical (or functional) behaviour of combinational circuits. This separation is the fruit of several unstated

百科全書

amenity

0893-3405 arious solutions to the false path problem that had been proposed in the literature, with a view to determining the computational expense of each versus the gain in accuracy. However, it became clear that some of the proposed approaches in the literature were wrong in that they under- estimated the

panorama

Book 1991utions to the false path problem that had been proposed in the literature, with a view to determining the computational expense of each versus the gain in accuracy. However, it became clear that some of the proposed approaches in the literature were wrong in that they under- estimated the critical d

Banister

caldron

System Considerations and Approximations,pproximation to the longest viable path, so long as the assurance is given that such an approximation will not . the length of the longest viable path. In this section we explore such performance/quality tradeoffs, and end by giving a polynomial approximation to viability.

Keshan-disease

含水層

NOTCH

System Considerations and Approximations, the inner loop of the procedure is a general satisfiability problem, and hence is strongly suspected to be of exponential complexity. Further, there is some bookkeeping associated with the computation of the viability function. In general, some applications may prefer a faster answer and a poorer a