DASMOD Workshop on Verification of Adaptive Systems

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.

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@inproceedings{Radmacher2007DASMODWO, title={DASMOD Workshop on Verification of Adaptive Systems}, author={Frank G. Radmacher and Wolfgang Thomas}, year={2007} }