메뉴 건너뛰기




Volumn 935, Issue , 1995, Pages 374-391

Verification of asynchronous circuits by BDD-based model checking of petri nets

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS SEQUENTIAL LOGIC; BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; PETRI NETS; SPECIFICATIONS; TIMING CIRCUITS;

EID: 84956869194     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60029-9_50     Document Type: Conference Paper
Times cited : (60)

References (30)
  • 2
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • Aug
    • R. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8): 677-691, Aug. 1986.
    • (1986) IEEE Transactions on Computers , vol.C-35 , Issue.8 , pp. 677-691
    • Bryant, R.1
  • 9
    • 0003241540 scopus 로고
    • Why higher-order logic is a good formalism for specifying and verifying hardware
    • North Holland
    • M. Gordon. Why higher-order logic is a good formalism for specifying and verifying hardware. In Formal Aspects of VLSI Design, pages 153-177. North Holland, 1985.
    • (1985) Formal Aspects of VLSI Design , pp. 153-177
    • Gordon, M.1
  • 14
    • 0040185600 scopus 로고
    • Reducibility in analysis of coordination
    • Springer-Verlag
    • R. P. Kurshan. Reducibility in analysis of coordination. In LNCS, volume 103, pages 19-39. Springer-Verlag, 1987.
    • (1987) LNCS , vol.103 , pp. 19-39
    • Kurshan, R.P.1
  • 17
    • 0022217032 scopus 로고
    • The design of a self-timed circuit for distributed mutual exclusion
    • H. Fuchs, editor, Computer Science Press
    • A. J. Martin. The design of a self-timed circuit for distributed mutual exclusion. In H. Fuchs, editor, Proceedings of the Chapeł Hill Conference on VLSI, pages 245-260. Computer Science Press, 1985.
    • (1985) Proceedings of the Chapeł Hill Conference on VLSI , pp. 245-260
    • Martin, A.J.1
  • 18
    • 0022879965 scopus 로고
    • Compiling communicating processes into delay-insensitive VLSI circuits
    • A. J. Martin. Compiling communicating processes into delay-insensitive VLSI circuits. Distributed Computing, l(4): 226-234, 1986.
    • (1986) Distributed Computing , vol.1 , Issue.4 , pp. 226-234
    • Martin, A.J.1
  • 19
    • 0141515116 scopus 로고
    • Self-timed FIFO: An exercise in compiling programs into VLSI circuits
    • D. Borrione, editor, Elsevier Science Publishers
    • A. J. Martin. Self-timed FIFO: An exercise in compiling programs into VLSI circuits. In D. Borrione, editor, From HDL Descriptions to Guaranteed Correct Circuit Designs, pages 133-153. Elsevier Science Publishers, 1986.
    • (1986) From HDL Descriptions to Guaranteed Correct Circuit Designs , pp. 133-153
    • Martin, A.J.1
  • 20
    • 33847258494 scopus 로고
    • Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits
    • G. v. Bochman and D. K. Probst, editors, Springer-Verlag
    • K. L. McMillan. Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In G. v. Bochman and D. K. Probst, editors, Proc. International Workshop on Computer Aided Verification, volume 663 of Lecture Notes in Computer Science, pages 164-177. Springer-Verlag, 1992.
    • (1992) Proc. International Workshop on Computer Aided Verification, volume 663 of Lecture Notes in Computer Science , pp. 164-177
    • McMillan, K.L.1
  • 22
    • 0024645936 scopus 로고
    • Petri nets: Properties, analysis and appücations
    • Apr
    • T. Murata. Petri nets: Properties, analysis and appücations. Proceedings of the IEEE, 77(4): 541-574, Apr. 1989.
    • (1989) Proceedings of the IEEE , vol.77 , Issue.4 , pp. 541-574
    • Murata, T.1
  • 27
    • 0001951703 scopus 로고
    • System timing
    • chapter 7. Mead & Conway, Addison-Wesley
    • C. L. Seitz. System timing. In Introduction to VLSI Systems, chapter 7. Mead & Conway, Addison-Wesley, 1980.
    • (1980) Introduction to VLSI Systems
    • Seitz, C.L.1
  • 28
    • 0006434030 scopus 로고
    • PhD thesis, Department of Computer Science, Eindhoven University of Technology, Oct
    • J. L. A. van de Snepscheut. Trace Theory and VLSI design. PhD thesis, Department of Computer Science, Eindhoven University of Technology, Oct. 1983.
    • (1983) Trace Theory and VLSI design
    • van de Snepscheut, J.L.A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.