A Game Theoretic Approach to the Analysis of Dynamic Networks

Electronic Notes in Theoretical Computer Science

Volumn 200, Issue 2, 2008, Pages 21-37

  Radmacher, Frank G ^a   Thomas, Wolfgang ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

adaptive systems; dynamic graph problems; dynamic networks; game theory; model checking

Indexed keywords

ADAPTIVE SYSTEMS; COMPUTABILITY AND DECIDABILITY; GRAPH THEORY; MODEL CHECKING;

DYNAMIC GRAPH PROBLEMS; DYNAMIC NETWORKS;

GAME THEORY;

EID: 39649113333     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.02.010     Document Type: Article

References (22)

1. Awerbuch, B., P. Berenbrink, A. Brinkmann and C. Scheideler, Simple routing strategies for adversarial systems, in: Proceedings of FOCS (2001), pp. 158-167
2. Awerbuch B., Brinkmann A., and Scheideler C. Anycasting in adversarial systems: Routing and admission control. Proceedings of ICALP. Lecture Notes in Computer Science 2719 (2003) 1153-1168
3. Bouajjani A., Habermehl P., Rogalewicz A., and Vojnar T. Abstract regular tree model checking of complex dynamic data structures. Proceedings of SAS. Lecture Notes in Computer Science 4134 (2006) 52-70
4. Corradini A. GETGRATS: A summary of scientific results (with annotated bibliography). Electronic Notes in Theoretical Computer Science 51 (2001)
5. Demri S. A reduction from DLP to PDL. Journal of Logic and Computation 15 (2005) 767-785
6. Clarke E.M., Grumberg J.O., and Peled D.A. Model checking (1999), MIT Press, Cambridge, MA, USA
7. Gadducci F., Heckel R., and Koch M. A fully abstract model for graph-interpreted temporal logic. Proceedings of TAGT. Lecture Notes in Computer Science 1764 (1998) 310-322
8. Göller S. On the complexity of reasoning about dynamic policies. Proceedings of CSL. Lecture Notes in Computer Science 4646 (2007) 358-373
9. Grädel E., Thomas W., and Wilke T. Automata, Logics, and Infinite Games. Lecture Notes in Computer Science 2500 (2002), Springer
10. 0. Theoretical Computer Science 3 (2003) 473-485
11. Hesse, W. and N. Immerman, Complete problems for dynamic complexity classes, in: Proceedings of LICS (2002), pp. 313-322
12. Holm J., de Lichtenberg K., and Thorup M. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. Journal of the ACM 48 (2001) 723-760
13. 2a (2006), pp. 94-110, http://modeva.itee.uq.edu.au
14. King V., and Sagert G. A fully dynamic algorithm for maintaining the transitive closure. Journal of Computer and System Sciences 65 (2002) 150-167
15. Lerda F., and Visser W. Addressing dynamic issues of program model checking. Proceedings of SPIN. Lecture Notes in Computer Science 2057 (2001) 80-102
16. Löding C., and Rohde P. Model checking and satisfiability for sabotage modal logic. Proceedings of FSTTCS. Lecture Notes in Computer Science 2914 (2003) 302-313
17. Löding, C. and P. Rohde, Solving the sabotage game is PSPACE-hard, Technical Report AIB-05-2003, RWTH Aachen (2003)
18. Löding C., and Rohde P. Solving the sabotage game is PSPACE-hard. Proceedings of MFCS. Lecture Notes in Computer Science 2747 (2003) 531-540
19. Rohde P. Moving in a crumbling network: The balanced case. Proceedings of CSL. Lecture Notes in Computer Science 3210 (2004) 310-324
20. Rohde, P., "On Games and Logics over Dynamically Changing Structures," Ph.D. thesis, RWTH Aachen (2005)
21. In: Rozenberg G. (Ed). Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations (1997), World Scientific
22. van Benthem J. An essay on sabotage and obstruction. In: Hutter D., and Stephan W. (Eds). Mechanizing Mathematical Reasoning, Essays in Honor of Jörg H. Siekmann on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 2605 (2005) 268-276