Min-max inequalities and the timing verification problem with max and linear constraints

In this paper the timing verification problem with max and linear constraints is formulated in min-max inequalities. An algorithm MMI solve, based on the UBC solve algorithm of Walkup, is proposed for solving min-max inequalities and for efficiently finding the maximum time separations between events. A concept of structural finite separation is introduced, and it is found that structural finite separation is a sufficient, but not necessary condition for Finite separation. The two conditions are equivalent when the parameters are only allowed to take nonnegative values.