메뉴 건너뛰기
Electronic Notes in Theoretical Computer Science
Volumn 68, Issue 6, 2003, Pages 71-84
Uniform solution of parity games on prefix-recognizable graphs
Author keywords

[No Author keywords available]
Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; GRAPH THEORY; LOGIC PROGRAMMING; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;
EID: 18944368424     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80534-6     Document Type: Conference Paper
Times cited : (31)
References (10)
  • 1
    • 84869180618 scopus 로고    scopus 로고
    • Symbolic Strategy Synthesis for Games on Pushdown Graphs
    • available at
    • CACHAT T. Symbolic Strategy Synthesis for Games on Pushdown Graphs. ICALP'02, LNCS 2380. 2002;704-715. available at http://www-i7.informatik.rwth- aachen.de/~cachat/publi.html
    • (2002) ICALP'02, LNCS 2380 , pp. 704-715
    • Cachat, T.1
  • 2
    • 84947770514 scopus 로고    scopus 로고
    • On infinite transition graphs having a decidable monadic theory
    • CAUCAL D. On infinite transition graphs having a decidable monadic theory. ICALP'96, LNCS 1099. 1996;194-205
    • (1996) ICALP'96, LNCS 1099 , pp. 194-205
    • Caucal, D.1
  • 3
    • 84898910336 scopus 로고    scopus 로고
    • On the transition graphs of Turing machines
    • Full version to appear in TCS, available at
    • CAUCAL D. On the transition graphs of Turing machines. 3rd MCU, LNCS 2055. 2001;177-189. Full version to appear in TCS, available at http://www.irisa.fr/galion/caucal/biblio.html
    • (2001) 3rd MCU, LNCS 2055 , pp. 177-189
    • Caucal, D.1
  • 4
    • 0026368952 scopus 로고
    • Tree automata, mu-calculus and determinacy
    • IEEE Computer Society Press
    • EMERSON E.A., JUTLA C.S. Tree automata, mu-calculus and determinacy. FoCS'91. 1991;368-377 IEEE Computer Society Press
    • (1991) FoCS'91 , pp. 368-377
    • Emerson, E.A.1    Jutla, C.S.2
  • 6
    • 84944414150 scopus 로고    scopus 로고
    • An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
    • KUPFERMAN O., VARDI M.Y. An Automata-Theoretic Approach to Reasoning about Infinite-State Systems. CAV'00, LNCS 1855. 2000;36-52
    • (2000) CAV'00, LNCS 1855 , pp. 36-52
    • Kupferman, O.1    Vardi, M.Y.2
  • 7
    • 18944362726 scopus 로고    scopus 로고
    • Note on winning positions on pushdown games with omega-regular conditions
    • to appear in
    • O. SERRE, Note on Winning Positions on Pushdown Games with Omega-Regular Conditions, to appear in Information Processing Letter, 2002. available at http://www.liafa.jussieu.fr/~serre/recherche.html.
    • (2002) Information Processing Letter
    • Serre, O.1
  • 8
    • 84878592842 scopus 로고    scopus 로고
    • Reasoning about the past with two-way automata
    • VARDI M.Y. Reasoning about the past with two-way automata. ICALP'98, LNCS 1443. 1998;628-641
    • (1998) ICALP'98, LNCS 1443 , pp. 628-641
    • Vardi, M.Y.1
  • 9
    • 84944395659 scopus 로고    scopus 로고
    • A discrete strategy improvement algorithm for solving parity games
    • VÖGE J., JURDZIŃSKI M. A discrete strategy improvement algorithm for solving parity games. CAV'00, LNCS 1855. 2000;202-215
    • (2000) CAV'00, LNCS 1855 , pp. 202-215
    • Vöge, J.1    Jurdziński, M.2
  • 10
    • 84957642329 scopus 로고    scopus 로고
    • Pushdown processes: Games and model checking
    • Full version in Information and Computation 157, 2000
    • WALUKIEWICZ I. Pushdown processes: games and model checking. CAV'96, LNCS 1102. 1996;62-74. Full version in Information and Computation 157, 2000
    • (1996) CAV'96, LNCS 1102 , pp. 62-74
    • Walukiewicz, I.1

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