Computing game values for crash games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4762 LNCS, Issue , 2007, Pages 177-191

  Gawlitza, Thomas ^a   Seidl, Helmut ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; HIERARCHICAL SYSTEMS; INTEGER PROGRAMMING; OPTIMIZATION; VERIFICATION;

CRASH GAME; INTEGER EQUATIONS;

GAME THEORY;

EID: 38149032834     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75596-8_14     Document Type: Conference Paper

References (19)

1. Arnold, A., Niwinski, D.: Rudiments of μ-Calculus. In: Studies in Logic and The Foundations of Computer Science, vol. 146, North-Holland, Amsterdam (2001)
2. Bjorklund, H., Sandberg, S., Vorobyov, S.: Complexity of Model Checking by Iterative Improvement: the Pseudo-Boolean Framework. In: Broy, M., Zamulin, A.V. (eds.) PSI 2003. LNCS, vol. 2890, pp. 381-394. Springer, Heidelberg (2004)
3. Chatterjee, K., Henzinger, T.A., Jurdzinski, M.: Mean-payoff parity games. In: LICS, pp. 178-187. IEEE Computer Society, Los Alamitos (2005)
4. Chechik, M., Devereux, B., Easterbrook, S.M., Gurfinkel, A.: Multi-valued symbolic model-checking. ACM Trans. Softw. Eng. Methodol. 12(4), 371-408 (2003)
5. Costan, A., Gaubert, S., Goubault, E., Martel, M., Putot, S.: A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 462-475. Springer, Heidelberg (2005)
6. Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy (extended abstract). In: FOCS, pp. 368-377. IEEE Computer Society Press, Los Alamitos (1991)
7. Gawlitza, T., Reineke, J., Seidl, H., Wilhelm, R.: Polynomial Exact Interval Analysis Revisited. Technical report, TU München (2006)
8. Gawlitza, T., Seidl, H.: Precise fixpoint computation through strategy iteration. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 300-315. Springer, Heidelberg (2007)
9. Gimbert, H., Zielonka, W.: When can you play positionally? In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 686-697. Springer, Heidelberg (2004)
10. Gimbert, H., Zielonka, W.: Games where you can play optimally without any memory. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 428-442. Springer, Heidelberg (2005)
11. Hoffman, A.J., Karp, R.M.: On Nonterminating Stochastic Games. Management Sci. 12, 359-370 (1966)
12. Howard, R.: Dynamic Programming and Markov Processes. Wiley, New York (1960)
13. Jrklund, H., Nilsson, O., Svensson, O., Vorobyov, S.: The Controlled Linear Programming Problem. Technical report, DIMACS (2004)
14. Jurdziński, M.: Small Progress Measures for Solving Parity Games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 290-301. Springer, Heidelberg (2000)
15. Puri, A.: Theory of Hybrid and Discrete Systems. PhD thesis, University of California, Berkeley (1995)
16. Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York (1994)
17. Seidl, H.: A Modal μ Calculus for Durational Transition Systems. In: IEEE Conf. on Logic in Computer Science (LICS), pp. 128-137 (1996)
18. Shoham, S., Grumberg, O.: Multi-valued model checking games. In: Peled, D.A., Tsay, Y.K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 354-369. Springer, Heidelberg (2005)
19. Vöge, J., Jurdzinski, M.: A Discrete Strategy Improvement Algorithm for Solving Parity Games. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 202-215. Springer, Heidelberg (2000)