Abstract
This 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T. Amon, H. Hulgaard, S.M. Burns, and G. Borriello, “An algorithm for exact bounds on the time separation of events in concurrent systems,” in Proceedings of IEEE International Conference on Computer Design, pp. 166–173, 1993.
G. Borriello and R. Katz, “Synthesis and optimization of interface transducer logic,” in Proceedings of IEEE International Conference on Computer-Aided Design, 1987.
J.A. Brzozowski, T. Gahlinger, and F. Mavaddat, “Consistency and satisfiability of waveform timing specification,” Networks, pp. 91–107, Jan. 1991.
T. Burks and K. Sakallah, “Min-max linear programming and the timing analysis of digital circuits,” in Proceedings of IEEE International Conference on Computer-Aided Design, pp. 152–155, 1993.
P. Chou, E.A. Walkup, and G. Borriello, “Scheduling for reactive real-time systems,” IEEE MICRO, Vol. 14, No. 4, pp. 37–47, Aug. 1994.
T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. McGraw-Hill, 1990.
A.J. Daga and W.P. Birmingham, “VITCh: A methodology for the timing verification of board-level circuits,” in Proceedings of TAU Workshop, 1993.
T. Gahlinger, “Coherence and satisfiability of waveform timing specification,” Ph.D. thesis, University of Waterloo, May 1990.
Integrated Device Technology, Inc., Logic Data Book, 1990.
Intel Corporation, Microsystem Components Handbook, 1986.
Intel Corporation, Microprocessors, 1990.
Intel Corporation, Memory, 1990.
D. Ku and G. de Micheli, “Relative scheduling under timing constraints,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 11, No. 6, pp. 696–717, June 1992.
L. Lavagno and A. Sangiovanni-Vincentelli, “Linear programming for optimum hazard elimination in asynchronous circuits,” in Proceedings of IEEE International Conference on Computer Design, 1992.
Y.-Z. Liao and C.K. Wong, “An algorithm to compact a VLSI symbolic layout with mixed constraints,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. CAD-2, No. 2, pp. 62–69, April 1983.
K. McMillan and D. Dill, “Algorithms for interface timing verification,” in Proceedings of IEEE International Conference on Computer Design, pp. 48–51, 1992.
C. Myers and T.H.Y. Meng, “Synthesis of timed asynchronous circuits,” in Proceedings of IEEE International Conference on Computer Design, pp. 279–284, 1992.
K.A. Sakallah, T.N. Mudge, and O.A. Olukotun, “Timing verification and optimal clocking of synchronous digital circuits,” in Proceedings of IEEE International Conference on Computer-Aided Design, 1990.
P. Vanbekbergen, G. Goossens, and H. de Man, “Specification and analysis of timing constraints in signal transition graphs,” in Proceedings of the European Conference on Design Automation, pp. 302–306, 1992.
E.A. Walkup, “Optimization of linear max-plus systems with application to timing analysis,” Ph.D. thesis, University of Washington, 1995.
E.A. Walkup and G. Borriello, “Interface timing verification with application to synthesis,” in Proceedings of Design Automation Conference, pp. 106–112, 1994.
W.H. Wolf and A.E. Dunlop, “Symbolic layout and compaction” in B.T. Preas and M.J. Lorenzetti (Eds.), Physical Design Automation of VLSI Systems, Benjamin-Cummings, Chap. 6, pp. 211–281, 1988.
Ti-Yen Yen and W. Wolf, “Performance estimation for real-time distributed embedded systems,” in Proceedings of IEEE International Conference on Computer Design, pp. 64–69, 1995.
Rights and permissions
About this article
Cite this article
Yen, TY., Ishii, A., Casavant, A. et al. Efficient Algorithms for Interface Timing Verification. Formal Methods in System Design 12, 241–265 (1998). https://doi.org/10.1023/A:1008680300467
Issue Date:
DOI: https://doi.org/10.1023/A:1008680300467