메뉴 건너뛰기




Volumn 274, Issue 1-2, 2002, Pages 183-230

From rewrite rules to bisimulation congruences

Author keywords

Bisimulation; Labelled transition systems; Operational congruences; Operational semantics; Process calculi; Term rewriting

Indexed keywords

COMPUTER SCIENCE; COMPUTER SIMULATION; LOGIC PROGRAMMING;

EID: 0037028904     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00309-1     Document Type: Conference Paper
Times cited : (42)

References (42)
  • 6
    • 0000463260 scopus 로고    scopus 로고
    • A congruence theorem for structured operational semantics of higher-order languages
    • (1998) Proc. LICS , vol.98
    • Bernstein, K.L.1


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