메뉴 건너뛰기




Volumn 93, Issue 1-3, 2009, Pages 81-96

What agents can probably enforce

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING TIME TEMPORAL LOGIC; APPLICATION AREA; CRITICAL SYSTEMS; LOGICAL APPROACHES; SECURITY PROTOCOLS; SPACE MISSIONS; TEMPORAL PROPERTY;

EID: 67651174731     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/FI-2009-0089     Document Type: Article
Times cited : (27)

References (12)
  • 3
    • 85037030721 scopus 로고
    • Design and synthesis of synchronization skeletons using branching time temporal logic
    • Proceedings of Logics of Programs Workshop, of
    • E. Clarke and E. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proceedings of Logics of Programs Workshop, volume 131 of Lecture Notes in Computer Science, pages 52-71, 1981.
    • (1981) Lecture Notes in Computer Science , vol.131 , pp. 52-71
    • Clarke, E.1    Emerson, E.2
  • 4
    • 21144438301 scopus 로고    scopus 로고
    • Model checking discounted temporal properties
    • Proceedings of TACAS'04, of
    • L. de Alfaro, M. Faella, T. Henzinger, R. Majumdar, and M. Stoelinga. Model checking discounted temporal properties. In Proceedings of TACAS'04, volume 2988 of LNCS, pages 57-68, 2004.
    • (2004) LNCS , vol.2988 , pp. 57-68
    • de Alfaro, L.1    Faella, M.2    Henzinger, T.3    Majumdar, R.4    Stoelinga, M.5
  • 5
    • 0000595574 scopus 로고
    • Computational complexity of probabilistic Turing machines
    • J. Gill. Computational complexity of probabilistic Turing machines. SIAM Journal on Computing, 6(4), 1977.
    • (1977) SIAM Journal on Computing , vol.6 , Issue.4
    • Gill, J.1
  • 6
    • 0002376906 scopus 로고
    • Number of quantifiers is better than number of tape cells
    • N. Immerman. Number of quantifiers is better than number of tape cells. Journal of Computer and System Sciences, 22(3):384-406, 1981.
    • (1981) Journal of Computer and System Sciences , vol.22 , Issue.3 , pp. 384-406
    • Immerman, N.1
  • 10
    • 0024766356 scopus 로고
    • On the computational power of PP and P
    • S. Toda. On the computational power of PP and P. In Proceedings of IEEE FOCS'89, pages 514-519, 1989.
    • (1989) Proceedings of IEEE FOCS'89 , pp. 514-519
    • Toda, S.1
  • 11
    • 49249151236 scopus 로고
    • The complexity of computing the permanent
    • L. G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189-201, 1979.
    • (1979) Theoretical Computer Science , vol.8 , pp. 189-201
    • Valiant, L.G.1


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