메뉴 건너뛰기




Volumn 3653, Issue , 2005, Pages 428-442

Games where you can play optimally without any memory

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMICS; MAPPING; OPTIMIZATION; SYSTEMS ANALYSIS;

EID: 27244448317     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539452_33     Document Type: Conference Paper
Times cited : (94)

References (14)
  • 1
    • 24044437255 scopus 로고    scopus 로고
    • Pushdown games with unboundedness and regular conditions
    • FSTTCS
    • A. Bouquet, O. Serre, and I. Walukiewicz. Pushdown games with unboundedness and regular conditions. In FSTTCS, volume 2380 of LNCS, pages 88-99, 2003.
    • (2003) LNCS , vol.2380 , pp. 88-99
    • Bouquet, A.1    Serre, O.2    Walukiewicz, I.3
  • 2
    • 84947732368 scopus 로고    scopus 로고
    • 3 winning condition
    • CSL
    • 3 winning condition. In CSL, volume 2471 of LNCS, pages 322-336, 2002.
    • (2002) LNCS , vol.2471 , pp. 322-336
    • Cachat, T.1    Duparc, J.2    Thomas, W.3
  • 5
    • 21144438301 scopus 로고    scopus 로고
    • Model checking discounted temporal properties
    • TACAS 2004. Springer
    • L. de Alfaro, M. Faella, T. A. Henzinger, Rupak Majumdar, and Mariëlle Stoelinga. Model checking discounted temporal properties. In TACAS 2004, volume 2988 of LNCS, pages 77-92. Springer, 2004.
    • (2004) LNCS , vol.2988 , pp. 77-92
    • De Alfaro, L.1    Faella, M.2    Henzinger, T.A.3    Majumdar, R.4    Stoelinga, M.5
  • 6
    • 35248855366 scopus 로고    scopus 로고
    • Discounting the future in systems theory
    • ICALP 2003. Springer
    • L. de Alfaro, T. A. Henzinger, and Rupak Majumdar. Discounting the future in systems theory. In ICALP 2003, volume 2719 of LNCS, pages 1022-1037. Springer, 2003.
    • (2003) LNCS , vol.2719 , pp. 1022-1037
    • De Alfaro, L.1    Henzinger, T.A.2    Majumdar, R.3
  • 8
    • 0026368952 scopus 로고
    • Tree automata, μ-calculus and determinacy
    • IEEE Computer Society Press
    • E.A. Emerson and C. Jutla. Tree automata, μ-calculus and determinacy. In FOCS'91, pages 368-377. IEEE Computer Society Press, 1991.
    • (1991) FOCS'91 , pp. 368-377
    • Emerson, E.A.1    Jutla, C.2
  • 9
    • 24044546581 scopus 로고    scopus 로고
    • Parity and exploration games on infinite graphs
    • Computer Science Logic 2004. Springer
    • H. Gimbert. Parity and exploration games on infinite graphs. In Computer Science Logic 2004, volume 3210 of LNCS, pages 56-70. Springer, 2004.
    • (2004) LNCS , vol.3210 , pp. 56-70
    • Gimbert, H.1
  • 10
    • 26844491346 scopus 로고    scopus 로고
    • When can you play positionally?
    • Mathematical Foundations of Computer Science 2004. Springer
    • H. Gimbert and W. Zielonka. When can you play positionally? In Mathematical Foundations of Computer Science 2004, volume 3153 of LNCS, pages 686-697. Springer, 2004.
    • (2004) LNCS , vol.3153 , pp. 686-697
    • Gimbert, H.1    Zielonka, W.2
  • 11
    • 21044460198 scopus 로고    scopus 로고
    • Positional determinacy of infinite games
    • STACS. Springer
    • E. Grädel. Positional determinacy of infinite games. In STACS, volume 2996 of LNCS, pages 4-18. Springer, 2004.
    • (2004) LNCS , vol.2996 , pp. 4-18
    • Grädel, E.1
  • 12
    • 0004214083 scopus 로고
    • Games with forbidden positions
    • Uniwersytet Gdański, Instytut Matematyki
    • A.W. Mostowski. Games with forbidden positions. Technical Report 78, Uniwersytet Gdański, Instytut Matematyki, 1991.
    • (1991) Technical Report , vol.78
    • Mostowski, A.W.1


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