메뉴 건너뛰기




Volumn 89, Issue 1, 2003, Pages 4-16

Parallel model checking for LTL, CTL*, and L2μ

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; COMPUTER SCIENCE; COMPUTER SOFTWARE; GRAPH THEORY; ITERATIVE METHODS; PROBLEM SOLVING;

EID: 16244393913     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80093-3     Document Type: Conference Paper
Times cited : (10)

References (12)
  • 7
    • 0028420232 scopus 로고
    • * as fragments of the modal m̈-calculus
    • * as fragments of the modal m̈-calculus. Theoretical Computer Science. 126:(1):Apr. 1994;77-96
    • (1994) Theoretical Computer Science , vol.126 , Issue.1 , pp. 77-96
    • Dam, M.1
  • 10
    • 49049126479 scopus 로고
    • Results on the propositional mu-calculus
    • Kozen D. Results on the propositional mu-calculus. Theoretical Computer Science. 27:Dec. 1983;333-354
    • (1983) Theoretical Computer Science , vol.27 , pp. 333-354
    • Kozen, D.1
  • 12
    • 18944402165 scopus 로고    scopus 로고
    • Notes for Mathfit Workshop on finite model theory, University of Wales, Swansea
    • Stirling C. Games for bisimulation and model checking. July 1996;. Notes for Mathfit Workshop on finite model theory, University of Wales, Swansea
    • (1996) Games for Bisimulation and Model Checking
    • Stirling, C.1


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