Moving in a network under random failures: A complexity analysis

Science of Computer Programming

Volumn 77, Issue 7-8, 2012, Pages 940-954

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

^a RWTH AACHEN UNIVERSITY   (Germany)

^b JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Fault tolerant systems; Game theory; Probabilistic systems; Sabotage games

Indexed keywords

COMPLEXITY ANALYSIS; DYNAMIC GRAPH; EDGE FAILURES; FAULT-TOLERANT SYSTEMS; FOLLOWING PROBLEM; LTL FORMULAE; PROBABILISTIC SYSTEMS; RANDOM FAILURES; ROUTING PROBLEMS; SABOTAGE GAMES; UNIFORM DISTRIBUTION; WINNING CONDITIONS;

CRIME; GAME THEORY;

PROBABILITY;

EID: 84859758953     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2010.05.009     Document Type: Article

References (19)

1. J. van Benthem An essay on sabotage and obstruction Mechanizing Mathematical Reasoning, Essays in Honor of Jrg H. Siekmann on the Occasion of his 60th Birthday Lecture Notes in Computer Science vol. 2605 2005 Springer 268 276 (Pubitemid 350227631)
2. C. Lding, P. Rohde, Solving the Sabotage Game is PSPACE-hard, Technical report AIB-05-2003, RWTH Aachen, 2003.
3. C. Lding, and P. Rohde Solving the sabotage game is PSPACE-hard Proceedings of MFCS Lecture Notes in Computer Science vol. 2747 2003 Springer 531 540
4. C. Lding, and P. Rohde Model checking and satisfiability for sabotage modal logic Proceedings of FSTTCS Lecture Notes in Computer Science vol. 2914 2003 Springer 302 313
5. P. Rohde Moving in a crumbling network: the balanced case Proceedings of CSL Lecture Notes in Computer Science vol. 3210 2004 Springer 310 324 (Pubitemid 39751596)
6. P. Rohde, On games and logics over dynamically changing structures, Ph.D. thesis, RWTH Aachen, 2005.
7. N. Gierasimczuk, L. Kurzen, and F.R. Velzquez-Quesada Learning and teaching as a game: a sabotage approach Proceedings of LORI Lecture Notes in Computer Science vol. 5834 2009 Springer 119 132
8. C.H. Papadimitriou Games against nature Journal of Computer and System Sciences 31 1985 288 301
9. E.M. Clarke Jr., O. Grumberg, and D.A. Peled Model Checking 2000 The MIT Press Cambridge, MA, USA
10. C. Baier, and J.-P. Katoen Principles of Model Checking 2008 The MIT Press Cambridge, MA, USA
11. A. Pnueli, and R. Rosner On the synthesis of an asynchronous reactive module ICALP Lecture Notes in Computer Science vol. 372 1989 Springer 652 671
12. C. Courcoubetis, and M. Yannakakis The complexity of probabilistic verification Journal of the ACM 42 1995 857 907
13. C.H. Papadimitriou Computational Complexity 1994 Addison Wesley
14. M.L. Littman, S.M. Majercik, and T. Pitassi Stochastic boolean satisfiability Journal of Automated Reasoning 27 2001 251 296 (Pubitemid 32933529)
15. D. Klein, F.G. Radmacher, and W. Thomas The complexity of reachability in randomized sabotage games Proceedings of FSEN Lecture Notes in Computer Science vol. 5961 2009 Springer 162 177
16. J. von zur Gathen, and J. Gerhard Modern Computer Algebra second ed. 2003 Cambridge University Press Cambridge, UK
17. D. Klein, Solving randomized sabotage games for navigation in networks, Diploma thesis, RWTH Aachen, 2008.
18. D.M. Gabbay Introducing reactive Kripke semantics and arc accessibility Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of his 85th Birthday Lecture Notes in Computer Science vol. 4800 2008 Springer 292 341
19. F.G. Radmacher, and W. Thomas A game theoretic approach to the analysis of dynamic networks Proceedings of VerAS Electronic Notes in Theoretical Computer Science vol. 200 (2) 2008 Elsevier 21 37 (Pubitemid 351288606)