New algorithms for static and dynamic sensitization of paths in timing analysis

Describes two algorithms in order to bring up a new solution to the well known problem of paths sensitization in timing analysis. The first algorithm PSV (path sensitizability verification) determines whether or not there is a pattern that activates a given path. If not, the path is called a false path. Then the second algorithm SPS (substitute path search) will find out the new longer path in a fast run time. Both algorithms work on a functional description of the circuit called an event graph, that includes timing information. Computing time is hugely improved by using local permutations in conflict treatment while propagating logical conditions