메뉴 건너뛰기




Volumn 126, Issue 1, 1994, Pages 77-96

CTL* and ECTL* as fragments of the modal μ-calculus

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; ERROR DETECTION; LOGIC PROGRAMMING;

EID: 0028420232     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)90269-0     Document Type: Article
Times cited : (104)

References (34)
  • 8
    • 0025494721 scopus 로고
    • Tableau-based model checking in the propositional mu-calculus
    • (1990) Acta Inform. , vol.27 , pp. 725-747
    • Cleaveland1
  • 11
    • 0022514018 scopus 로고
    • “Sometimes” and “not never” revisited: on branching versus linear time
    • (1986) J. ACM , vol.33 , pp. 151-178
    • Emerson1    Halpern2
  • 18
    • 0021974161 scopus 로고
    • Algebraic laws for nondeterminism and concurrency
    • (1985) J. ACM , vol.32 , pp. 137-162
    • Hennessy1    Milner2
  • 26
    • 0000690591 scopus 로고
    • Propositional dynamic logic of looping and converse is elementarily decidable
    • (1982) Inform. and Control , vol.54 , pp. 121-141
    • Streett1
  • 32
    • 84913008248 scopus 로고    scopus 로고
    • A translation from full branching time temporal logic to one letter propositional dynamic logic with looping, un, published, manuscript.
    • P. Wolper, A translation from full branching time temporal logic to one letter propositional dynamic logic with looping, unpublished manuscript.
    • Wolper1


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