A Game Theoretic Approach to the Analysis of Dynamic Networks

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.

[1]  Reiko Heckel,et al.  A Fully Abstract Model for Graph-Interpreted Temporal Logic , 1998, TAGT.

[2]  William Hesse,et al.  The dynamic complexity of transitive closure is in DynTC0 , 2001, Theor. Comput. Sci..

[3]  Stephan Merz,et al.  Model Checking , 2000 .

[4]  Christof Löding,et al.  Model Checking and Satisfiability for Sabotage Modal Logic , 2003, FSTTCS.

[5]  Johan van Benthem,et al.  An Essay on Sabotage and Obstruction , 2005, Mechanizing Mathematical Reasoning.

[6]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[7]  Mikkel Thorup,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.

[8]  Neil Immerman,et al.  Complete problems for dynamic complexity classes , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[9]  Willem Visser,et al.  Addressing dynamic issues of program model checking , 2001, SPIN '01.

[10]  Stefan Göller.  On the Complexity of Reasoning About Dynamic Policies , 2007, CSL.

[11]  Stéphane Demri,et al.  A Reduction from DLP to PDL , 2005, J. Log. Comput..

[12]  Ivan Porres,et al.  Model Checking Dynamic and Hierarchical UML State Machines , 2006 .

[13]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[14]  Philipp Rohde,et al.  On games and logics over dynamically changing structures , 2005 .

[15]  Christof Löding,et al.  Solving the Sabotage Game Is PSPACE-Hard , 2003, MFCS.

[16]  Philipp Rohde.  Moving in a Crumbling Network: The Balanced Case , 2004, CSL.

[17]  Andrea Corradini.  GETGRATS: A summary of scientific results (with annotated bibliography) , 2001, Electron. Notes Theor. Comput. Sci..

[18]  Valerie King,et al.  A fully dynamic algorithm for maintaining the transitive closure , 1999, STOC '99.

[19]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[20]  Christian Scheideler,et al.  Simple routing strategies for adversarial systems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[21]  Christian Scheideler,et al.  Anycasting in Adversarial Systems: Routing and Admission Control , 2003, ICALP.

[22]  Ahmed Bouajjani,et al.  Abstract Regular Tree Model Checking of Complex Dynamic Data Structures , 2006, SAS.