메뉴 건너뛰기




Volumn , Issue , 1996, Pages 152-163

Using partial orders for trace theoretic verification of asynchronous circuits

Author keywords

[No Author keywords available]

Indexed keywords

TIMING CIRCUITS;

EID: 84969373200     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASYNC.1996.494447     Document Type: Conference Paper
Times cited : (33)

References (20)
  • 7
    • 0348225427 scopus 로고
    • Defining conditional independence using collapses
    • M. Kwiatkowska (ed.), Springer
    • S. Katz and D. Peled. Defining conditional independence using collapses. Semantics for concurrency, BCS-FACS Workshop, M. Kwiatkowska (ed.), Springer, 1990.
    • (1990) Semantics for Concurrency, BCS-FACS Workshop
    • Katz, S.1    Peled, D.2
  • 9
    • 85041837331 scopus 로고
    • On model checking for petri nets and a linear-time temporal logic
    • T. Yoneda and H. Schlingloff. On model checking for Petri nets and a linear-time temporal logic. IEICE technical report, FTS92(l):1-8, 1992.
    • (1992) IEICE Technical Report , vol.FTS92 , Issue.1 , pp. 1-8
    • Yoneda, T.1    Schlingloff, H.2
  • 11
    • 5844249501 scopus 로고
    • Specification and automatic verification of self-timed queues
    • IEEE computer society press
    • D. L. Dill, S. M. Nowick, and R. F. Sproull. Specification and automatic verification of self-timed queues. In Formal verification of hardware design. IEEE computer society press, 1990.
    • (1990) Formal Verification of Hardware Design
    • Dill, D.L.1    Nowick, S.M.2    Sproull, R.F.3
  • 13
    • 0029482463 scopus 로고
    • Combining partial orders and symbolic traversal for efficient verification of asynchronous circuits
    • Alexei Semenov and Alexandre Yakovlev. Combining partial orders and symbolic traversal for efficient verification of asynchronous circuits. Proc. of CHDL'95, pages 567-573, 1995.
    • (1995) Proc. of CHDL'95 , pp. 567-573
    • Semenov, A.1    Yakovlev, A.2
  • 14
    • 84947925823 scopus 로고
    • Trace theoretic verification of asynchronous circuits using unfoldings
    • K. L. McMillan. Trace theoretic verification of asynchronous circuits using unfoldings. LNCS 939 Computer aided verification, pages 180-195, 1995.
    • (1995) LNCS 939 Computer Aided Verification , pp. 180-195
    • McMillan, K.L.1
  • 18
    • 85069171564 scopus 로고
    • Automatic verification method of asynchronous circuits using petri nets
    • I. Honma and T. Yoneda. Automatic verification method of asynchronous circuits using Petri nets. IEICE technical report (in Japanese), FTS92(24):23-30, 1992.
    • (1992) IEICE Technical Report (In Japanese) , vol.FTS92 , Issue.24 , pp. 23-30
    • Honma, I.1    Yoneda, T.2
  • 20
    • 30244447370 scopus 로고
    • Verification of bounded delay asynchronous circuits with timed traces
    • 94TR-0013
    • T. Yoneda, I. Honma, and H. Schlingloff. Verification of bounded delay asynchronous circuits with timed traces. TIT technical report, 94TR-0013, 1994.
    • (1994) TIT Technical Report
    • Yoneda, T.1    Honma, I.2    Schlingloff, H.3


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