Symbolic timing analysis of asynchronous systems

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 19, Issue 10, 2000, Pages 1093-1104

  Hulgaard, Henrik ^a   Amon, Tod ^b  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b SOUTHERN UTAH UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYNCHRONOUS SEQUENTIAL LOGIC; BOOLEAN FUNCTIONS; COMPUTER SIMULATION; DIGITAL ARITHMETIC; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PERFORMANCE;

ASYNCHRONOUS CIRCUITS; PRESBURGER ARITHMETIC; SYMBOLIC TIMING ANALYSIS; TIMING VERIFICATION;

INTEGRATED CIRCUIT TESTING;

EID: 0034292687     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.875262     Document Type: Article

References (29)

1. H. Hulgaard, S. M. Burns, T. Amon, and G. Borriello, "An algorithm for exact bounds on the time separation of events in concurrent systems," IEEE Trans. Comput., vol. 44, pp. 1306-1317, Nov. 1995.
2. C. J. Myers and T. H.-Y. Meng, "Synthesis of timed asynchronous circuits," IEEE Trans. VLSI Syst., vol. 1, pp. 106-119, Feb. 1993.
3. T. Amon and H. Hulgaard, "Nonstochastic analysis of manufacturing systems using timed-event graphs," J. Manufact. Syst., vol. 15, no. 3, 1996.
4. H. Hulgaard, S. M. Burns, T. Amon, and G. Boriello, "Practical applications of an efficient time separation of events algorithm," in Proc. Int. Conf. Computer-Aided Design (ICCAD), Nov. 1993, pp. 146-151.
5. T. E. Williams, "Analyzing and improving the latency and throughput performance of self-timed pipelines and rings," in Proc. Int. Symp. Circuits and Systems, May 1992.
6. _, "Performance of iterative computation in self-timed rings," J. VLSI Signal Processing, vol. 6, no. 3, Oct. 1993.
7. S. M. Burns, "Performance Analysis and Optimization of Asynchronous Circuits," Ph.D. dissertation, California Inst. Technol., Pasadena, 1991.
8. T. K. Lee, "A General Approach to Performance Analysis and Optimization of Asynchronour Circuits," Ph.D. dissertation, California Inst. Technol., Pasadena, 1995.
9. M. R. Greenstreet and K. Steiglitz, "Bubbles an make self-timed pipelines fast," J. VLSI Signal Processing, vol. 2, no. 3, pp. 139-148, Nov. 1990.
10. A. Xie and P. Beerel, "Symbolic techniques for performance analysis of timed systems based on average time separation of eventts," in Proc. 3rd Int. Symp. Advanced Research in Asynchronous Circuits and Systems (ASYNC), 1997, pp. 64-75.
11. R. Berks and J. Ebergen, "Response time properties of asynchronous linear pipelines," presented at the ACM/IEEE Int. Workshop Timing Issues in the Specification and Symthesis of Digital Systems (TAU), Austin, TX, Dec. 1997.
12. J. Ebergen and R. Berks, "Response time properties of some asynchronous circuits," in Proc. 3rd Int. Symp. Advanced Research in Asynchronous Circuits and Systems (ASYNC'97), Apr. 1997, pp. 76-86.
13. R. A. Chninghame-Green, Minimax Algegra of Lecture Notes in Economics and Mathematical Systems. New York: Springer-Verlag, 1979, vol. 166.
14. F. Baccelli, G. Cohen, G. J. Olsder, and J. P. Quadrat, Synchronization and Linearity. New York: Wiley, 1992.
15. J. Gunawardena, "Timing analysis of digital circuits and the theory of min-max functions," presented at the Int. Workshop Timing Issues in the Specification and Synthesis of Digital Systems (TAU), Malente, Germany, Sept. 1993.
16. H. Hulgaard and S. M. Burns, "Bounded delay timing analysis of a class of CSP program," Formal Meth. Syst. Design, vol. 11, no. 3, pp. 265-294, 1997.
17. T. M. Burks and K. A. Sakallah, "Min-max linear programming and the timing analysis of digital circuits," in Proc. Int. Conf. Computer-Aided Design (ICCAD), 1993, pp. 152-155.
18. T. Amon, G. Borriello, D. Hu, and J. Liu, "Symbolic timing verification of timing diagrams using Presburger formulas," in Proc. ACM/IEEE Design Automation Conf., June 1997, pp. 221-231.
19. T. Amon, G. Boriello, and J. Liu, "Making complex timing relationships readable: Presburger formula simplification using don't cares," in Proc. ACM/IEEE Design Automation Conf., June 1998, pp. 586-590.
20. T. Amon and G. Boriello, "An approach to symbolic timing verification," in Proc. ACM/IEEE Design Automation Conference, June 1992, pp. 410-113.
21. M. Presburger, "Über die Vollständigkeit eines gewissen systems der arithmetik ganzer zählen, in welchem die addition als einzige operation hervortritt," Computes-Rendus du I Congres de Mathematiciens des pays Slaves, pp. 92-101, 1929.
22. R. Shostak, "On the SUP-INF method for proving Presburger formulas," J. ACM, vol. 4, no. 24, pp. 529-543, Oct. 1977.
23. D. C. Cooper, "Theorem proving in arithmetic without multiplication," Machine Intell., vol. 7, pp. 91-99, 1972.
24. The Omega project. Dept. Comput. Eng., Univ. Maryland, College Park, MD. Online. Available: HTTP: http://www.cs.umd.edu/projects/omega/
25. K. McMillan and D. L. Dill, "Algorithms for itnerface timing verification," in Proc. IEEE Int. Conf. Computer Design, 1992, pp. 48-51.
26. H. Levy and D. W. Low, "A contraction algorithm for finding small cycle cutsets," J. Aglorithms, vol. 9, pp. 470-493, 1988.
27. R. E. Shostak, "A practical decision procedure for arithmetic with function symbols," J. ACM, vol. 26, no. 2, pp. 351-360, Apr. 1979.
28. A. J. Martin, S. M. Burns, T. K. Lee, D. Borkovic, and P. J. Hazewindus, "The design of an asynchronous microprocessor," m Advanced Research in VLSI: Proc. Decennial Caltech Conf. VLSI, 1989, pp. 351-373.
29. C.-Y. Park, "Execution Times of Real-Time Programs," Ph.D. dissertation. Available: Tech. Rep. TR-92-08-02, Univ. Washington, Seattle, 1992.