메뉴 건너뛰기




Volumn 1548, Issue , 1998, Pages 59-73

Verification of bounded delay asynchronous circuits with timed traces

Author keywords

Asynchronous circuits; Computer aided verification; Conformance checking; Delay analysis; Failure analysis; Hardware verification; Real time systems; State space exploration; Time petri nets; Trace theory

Indexed keywords

ALGEBRA; ASYNCHRONOUS SEQUENTIAL LOGIC; COMPUTER AIDED ANALYSIS; COMPUTER HARDWARE; DELAY CIRCUITS; FAILURE ANALYSIS; INTERACTIVE COMPUTER SYSTEMS; PETRI NETS; RECONFIGURABLE HARDWARE; SEMANTICS; SOFTWARE ENGINEERING; SPACE RESEARCH; SPECIFICATIONS;

EID: 84959017757     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49253-4_7     Document Type: Conference Paper
Times cited : (5)

References (13)
  • 6
    • 0023399846 scopus 로고
    • A Graph-Theoretic Approach for Timing Analysis and its Implementation
    • F. Jahanian and A. Mok: A Graph-Theoretic Approach for Timing Analysis and its Implementation; IEEE Trans. Comput. C-36(8):961–975 (1987).
    • (1987) IEEE Trans. Comput , vol.C-36 , Issue.8 , pp. 961-975
    • Jahanian, F.1    Mok, A.2
  • 8
    • 0000152257 scopus 로고
    • Recoverability of Communication Protocols
    • COM-24
    • P. Merlin and D. Faber: Recoverability of Communication Protocols; IEEE Trans. on Communication, COM-24(9), (1976).
    • (1976) IEEE Trans. On Communication , Issue.9
    • Merlin, P.1    Faber, D.2


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