Efficient Algorithms for Interface Timing Verification

AbstractThis paper presents algorithms for computing separations between events that are constrained to obey prespecified relationships in their relative time of occurrence. The algorithms are useful for interface timing verification, where event separations are checked against timing requirements. The first algorithm computes separations when only linear and max constraints exist. The algorithm must converge to correct maximum separation values in a finite number of steps, or report an inconsistence of the constraints, irrespective of the existence of infinite constraint bounds or infinite event separations. It is conjectured to run in $$O(VE + V^2 {\text{ log }}V)$$ time, where V is the number of events, and E is the number of relationships between them. The other algorithms extend the first, and compute event separations in the NP-complete version of the problem where min constraints exist. Experiments demonstrate the algorithms are efficient in practice.

[1]  Anthony Joseph Gahlinger.  Coherence and satisfiability of waveform timing specifications , 1990 .

[2]  Luciano Lavagno,et al.  Linear programming for optimum hazard elimination in asynchronous circuits , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[3]  Chak-Kuen Wong,et al.  An Algorithm to Compact a VLSI Symbolic Layout with Mixed Constraints , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Gaetano Borriello,et al.  Interface Timing Veri cation with Application to Synthesis , 1994 .

[5]  Karem A. Sakallah,et al.  Min-max linear programming and the timing analysis of digital circuits , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[6]  Giovanni De Micheli,et al.  Relative scheduling under timing constraints: algorithms for high-level synthesis of digital circuits , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  G. Goossens,et al.  Specification and analysis of timing constraints in signal transition graphs , 1992, [1992] Proceedings The European Conference on Design Automation.

[8]  R. Lathe.  Phd by thesis , 1988, Nature.

[9]  Gaetano Borriello,et al.  Interface Timing Verification with Application to Synthesis , 1994, 31st Design Automation Conference.

[10]  David L. Dill,et al.  Algorithms for interface timing verification , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[11]  Trevor N. Mudge,et al.  CheckT/sub c/ and minT/sub c/: timing verification and optimal clocking of synchronous digital circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[12]  Gaetano Borriello,et al.  Scheduling for reactive real-time systems , 1994, IEEE Micro.

[13]  Teresa H. Y. Meng,et al.  Synthesis of timed asynchronous circuits , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[14]  Gaetano Borriello,et al.  An Algorithm for Exact Bounds on the Time Separation of Events in Concurrent Systems , 1995, IEEE Trans. Computers.

[15]  Giovanni De Micheli,et al.  Relative scheduling under timing constraints , 1991, DAC '90.

[16]  Farhad Mavaddat,et al.  Consistency and satisfiability of waveform timing specifications , 1991, Networks.