Algorithms for interface timing verification

Algorithms for analyzing systems of inequalities with min/max constraints that arise in interface timing specifications are examined. A general form of the inequality is shown to be NP-complete, but some interesting special cases can be solved efficiently. A branch-and-bound solution to the general case is developed and applied to a previously published example.<<ETX>>

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

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

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

[4]  Teresa H. Meng,et al.  Asynchronous self-timed circuit synthesis with timing constraints , 1990, IEEE International Symposium on Circuits and Systems.