The complexity of reachability in randomized sabotage games

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

Volumn 5961 LNCS, Issue , 2010, Pages 162-177

  Klein, Dominik ^a   Radmacher, Frank G ^a   Thomas, Wolfgang ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Fault tolerant systems; Games; Probabilistic systems; Reachability

Indexed keywords

DYNAMIC GRAPH; EDGE FAILURES; FAULT-TOLERANT SYSTEMS; FOLLOWING PROBLEM; GAME AGAINST NATURE; GAME GRAPHS; PROBABILISTIC SYSTEMS; REACHABILITY; REACHABILITY PROBLEM;

COMPUTER SOFTWARE; PERMANENT MAGNETS;

PROBABILITY;

EID: 77949431514     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11623-0_9     Document Type: Conference Paper

References (13)

1. Gabbay, D.M.: Introducing reactive kripke semantics and arc accessibility. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol. 4800, pp. 292-341. Springer, Heidelberg (2008)
2. Klein, D.: Solving Randomized Sabotage Games for Navigation in Networks. Diploma thesis, RWTH Aachen (2008)
3. Littman, M.L., Majercik, S.M., Pitassi, T.: Stochastic boolean satisfiability. Journal of Automated Reasoning 27(3), 251-296 (2001)
4. Löding, C., Rohde, P.: Model checking and satisfiability for sabotage modal logic. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 302-313. Springer, Heidelberg (2003)
5. Löding, C., Rohde, P.: Solving the sabotage game is PSPACE-hard. Technical Report AIB-05-2003, RWTH Aachen (2003)
6. Löding, C., Rohde, P.: Solving the sabotage game is PSPACE-hard. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 531-540. Springer, Heidelberg (2003)
7. Papadimitriou, C.H.: Games against nature. Journal of Computer and System Sciences 31(2), 288-301 (1985)
8. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
9. Radmacher, F.G., Thomas, W.: A game theoretic approach to the analysis of dynamic networks. In: Poetzsch-Heffter, A., Schneider, K. (eds.) Proceedings of VerAS. Electronic Notes in Theoretical Computer Science, vol. 200(2), pp. 21-37. Elsevier, Amsterdam (2008)
10. Rohde, P.: Moving in a crumbling network: The balanced case. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 310-324. Springer, Heidelberg (2004)
11. Rohde, P.: On Games and Logics over Dynamically Changing Structures. PhD thesis, RWTH Aachen (2005)
12. van Benthem, J.: An essay on sabotage and obstruction. In: Hutter, D., Stephan, W. (eds.) Mechanizing Mathematical Reasoning. LNCS (LNAI), vol. 2605, pp. 268-276. Springer, Heidelberg (2005)
13. von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, Cambridge (2003)