Min-Max Inequalities and the Timing Verification Problem with Max and Linear Constraints

  • Authors:
  • Yiping Cheng;Da-Zhong Zheng

  • Affiliations:
  • School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China 100044;Department of Automation, Tsinghua University, Beijing, China 100044

  • Venue:
  • Discrete Event Dynamic Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper the timing verification problem with max and linear constraints is formulated in min--max inequalities. An algorithm MMIsolve, based on the UBCsolve 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.