Hierarchical timing view generation including accurate modeling for false paths

A hierarchical method for efficient solving the false path problem is presented. In a preprocessing step, all the local and user-intended logical incompatibilities are eliminated by generating timing views for these basic cells. These timing views are hierarchically composed, and there remain fewer (or no) logical incompatibilities. Therefore, the CPU-times required by the longest sensitizable path algorithm are much lower, and, for complex examples, this can mean a reduction of two orders of magnitude