A Game Theoretic Approach to the Analysis of Dynamic Networks

Authors:
Frank G. Radmacher;Wolfgang Thomas
Affiliations:
RWTH Aachen, Lehrstuhl für Informatik 7, 52056 Aachen, Germany;RWTH Aachen, Lehrstuhl für Informatik 7, 52056 Aachen, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 12
Cited 4

Handbook of graph grammars and computing by graph transformation: volume I. foundations

Handbook of graph grammars and computing by graph transformation: volume I. foundations
Model checking

Model checking
Addressing dynamic issues of program model checking

SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

Journal of the ACM (JACM)
A fully dynamic algorithm for maintaining the transitive closure

Journal of Computer and System Sciences - STOC 1999
Complete Problems for Dynamic Complexity Classes

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Model for Graph-Interpreted Temporal Logic

TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
The dynamic complexity of transitive closure is in DynTC0

Theoretical Computer Science - Database theory
Simple Routing Strategies for Adversarial Systems

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A Reduction from DLP to PDL

Journal of Logic and Computation
Abstract regular tree model checking of complex dynamic data structures

SAS'06 Proceedings of the 13th international conference on Static Analysis
On the complexity of reasoning about dynamic policies

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

A container multimodal transportation scheduling approach based on immune affinity model for emergency relief

Expert Systems with Applications: An International Journal
The complexity of reachability in randomized sabotage games

FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Moving in a network under random failures: A complexity analysis

Science of Computer Programming
Connectivity games over dynamic networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A model of dynamic networks is introduced which incorporates three kinds of network changes: deletion of nodes (by faults or sabotage), restoration of nodes (by actions of ''repair''), and creation of nodes (by actions that extend the network). The antagonism between the operations of deletion and restoration resp. creation is modelled by a game between the two agents ''Destructor'' and ''Constructor''. In this framework of dynamic model-checking, we consider as specifications (''winning conditions'' for Constructor) elementary requirements on connectivity of those networks which are reachable from some initial given network. We show some basic results on the (un-)decidability and hardness of dynamic model-checking problems.