Skip to main content
Log in

Description and Reasoning of VLSI circuit in temporal logic

  • Short Notes
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

This paper presents a method for describing and reasoning about the behavior of VLSI circuits within the framework of Extended Temporal Logic. For a reasoning method, an “ω-graph approach” is proposed which is useful in verifying the validity of a design. Not only verification but also other reasoning about circuit properties, such as unknown signal identification, can be treated in a unified way by this ω-graph approach. This approach has been studied as a basis of an expert system for the authors’ VLSI CAD system.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Mead, C., and Conway, L.: “Introduction to VLSI Systems”, Addison-Wesley Series on Computer Science (1980).

  2. Wolper, P. L.: “Synthesis of Communicating Processes from Temporal Logic Specifications” (Department of Computer Science, Stanford University, August, 1982).

  3. Fusaoka, A., Seki, H., and Takahashi, K.: “A Description and Reasoning of Plant controllers in Temporal Logic”, in Proceedings of the 8th International Joint Conference on Artificial Intelligence, IJCAI-83 (1983) 405–408.

  4. Hughes, G., and Cresswell, M.: “An Introduction to Modal Logic” (Methuen & Co., London, 1968).

    MATH  Google Scholar 

  5. Manna, Z. and Pnueli, A.: “Verification of Concurrent Programs, Part 1: The Temporal Framework” (Department of Computer Science, Stanford University, June, 1981).

  6. McNaughton, R.: “Testing and Generating Infinite Sequences by a Finite Automaton”, Information and Control,9 (1966) 521–530.

    Article  MATH  MathSciNet  Google Scholar 

  7. Bochmann, G. V.: “Hardware Specification with Temporal Logic: An Example,” IEEE Trans. on Computer,C-31, No. 3 (1982) 223–231.

    Article  MATH  MathSciNet  Google Scholar 

  8. Fujita, M., Tanaka, H. and Moto-oka, T.: “Verification with Prolog and Temporal Logic”, Proceedings of 6th IFIP CHDL (1983).

  9. Fujita, M., Tanaka, H. and Moto-oka, T.: “Temporal Logic Based Hardware Description and Its Verification with Prolog,” New Generation Computing,1 (1983) 195–203.

    Article  Google Scholar 

  10. Moszkowski, B.: “Reasoning about Digital Circuit”, Report No. STAN-CS-83-970, Rept. of C. S. (Stanford Univ., 1983).

  11. Mishra, B., and Clarke, E. M.: “Automatic and Hierarchical Verification of Asynchronous Circuit using Temporal Logic”, Report CMU-CS-83-155, Rept. of C. S. (CMU, 1983).

  12. Cohen, R. S. and Gold, A. Y.: “Theory of ω-languages. I: Characterization of ω-context-free languages,” J. Computer and System Science,15 (1977) 169–184.

    MATH  MathSciNet  Google Scholar 

  13. Kelly, E., and Steinberg, L.: “The CRITTER System: Analyzing Digital Circuits by Propagating Behaviors and Specifications,” Proceedings of the National Conference on Artificial Intelligence, AAAI-82 (1982) 284–289.

    Google Scholar 

  14. Sussman, G. J., and Steele Jr., G. L.: “CONSTRAINTS—A Language for Expressing Almost-Hierarchical Descriptions,” Artificial Intelligence,14 (1980) 1–39.

    Article  Google Scholar 

  15. Waldinger, R. J.: “Achieving Several Goals Simultaneously”, in Machine Intelligence,8 (1977) 94–136.

Download references

Author information

Authors and Affiliations

Authors

About this article

Cite this article

Fusaoka, A., Seki, H. & Takahashi, K. Description and Reasoning of VLSI circuit in temporal logic. NGCO 2, 79–90 (1984). https://doi.org/10.1007/BF03037053

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037053

Keyword

Navigation