An Efficient Implementation of Boolean Functions as Self-Timed Circuits

IEEE Transactions on Computers

Volumn 41, Issue 1, 1992, Pages 2-11

  Ginosai, Ran ^a   Yoeli, Michael ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Asynchronous systems; combinational logic; delay insensitive; self timed; temporal logic; verification

Indexed keywords

COMPUTER METATHEORY--BOOLEAN FUNCTIONS;

SELF-TIMED CIRCUITS;

COMPUTERS, DIGITAL;

EID: 0026623593     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.123377     Document Type: Article

References (20)

1. T. S. Anantharaman, “A delay insensitive regular expression recognizer,” IEEE VLSI Tech. Bull., Sept. 1986.
2. J. A. Brzozowski and J. C. Ebergen, “Recent developments in the design of asynchronous circuits,” in Proc. Seventh Int. Conf Fundamental Computat. Theory FCT’89, Hungary, Aug. 1989.
3. J. A. Brzozowski and J. C. Ebergen, private communication, 1990.
4. R. K. Brayton et al., Logic Minimization Algorithm for VLSI Synthesis. Norwell, MA: Kluwer Academic, 1984.
5. J. T. Butler, Guest Editor, Special Issue on Multiple Valued Logic, IEEE Comput. Mag., Apr. 1988.
6. I. David, R. Ginosar, and M. Yoeli, “Implementing sequential machines as self-timed circuits,” IEEE Trans. Comput., this issue, pp. 12–17.
7. A.L. Davis, private communication, 1988.
8. J.C. Ebergen, “Translating programs into delay-insensitive circuits,” Ph.D. dissertation, Eindhoven Univ. of Technology, 1987.
9. J. Halpern, Z. Manna, and B. Moszkowski, “A hardware semantics based on temporal intervals,” in Proc. 10th Int. Colloq. Automata, Languages and Programming, Barcelona, Spain. Berlin, Germany: Springer-Verlag, 1983, pp. 278–291.
10. L. Lamport, “What good is temporal logic?,” in Proc. Inform. Processing 83, R. E. A. Mason, Ed. Amsterdam, The Netherlands: North-Holland, pp. 657–668.
11. A. J. Martin, “Compiling communicating processes into delay insensitive VLSI circuits,” Distributed Comput., vol. 1, no. 3, 1986.
12. A. J. Martin, “Limitations to delay-insensitivity in asynchronous circuits,” Tech. Rep. CS-TR-90-02, Dep. Comput. Sci., California Institute of Technology, 1990.
13. Y. Malachi and S. Owicki, “Temporal specifications of self-timed systems,” in VLSI Systems and Computations, H.T. Kung B. Sproul, and G. Steel, Eds. Rockville, MD: Computer Science Press, 1981, pp. 203–212.
14. R. E. Miller, Switching Theory, Vol. 2. New York: Wiley, 1965.
15. B. Moszkowski, “A temporal logic for multilevel reasoning about hardware,” IEEE Comput. Mag., pp. 10–19, Feb. 1985.
16. Z. Manna and A. Pnueli “Verification of concurrent programs: The temporal framework,” in The Correctness Problem in Computer Science, R. S. Boyer and J. S. Moore, Eds., International Lecture Series in Computer Science. New York: Academic, 1981, pp. 215–273.
17. M. Rem, “Concurrent computations and VLSI circuits,” in Control Flow and Data Flow; Concepts of Distributed Computing, M. Broy Ed. Berlin, Germany: Springer-Verlag, 1985, pp. 399–437.
18. C. L. Seitz, “System timing”, in Introduction to VLSI Systems, C. Mead and L. Conway, Eds. Reading, MA: Addison-Wesley, 1980, pp. 218–262.
19. N. P. Singh, “A design methodology for self-timed systems,” M.Sc. Thesis, MIT Laboratory for Computer Science Tech. Rep. TR-258, MIT, Cambridge, MA, Feb. 1981.
20. J. L. A. Van de Snepscheut, Trace Theory and VLSI Design, LNCS 200, 1985.