Short destabilizing paths in timing verification

Designing an optimal clocking scheme for a sequential circuit requires accurate knowledge of the delay of its longest sensitizable and of its shortest destabilizing path. However, there is a large imbalance in the research effort spent on both types of paths. This paper tries to compensate this imbalance, by presenting a new destabilizing criterion, for which it will be proved that it leads to correct optimal clocking schemes. Furthermore, this paper results in clocking schemes which are tighter in comparison with those presented in literature