Sciweavers

CSL
2004
Springer

Moving in a Crumbling Network: The Balanced Case

14 years 4 months ago
Moving in a Crumbling Network: The Balanced Case
In this paper we continue the study of ‘sabotage modal logic’ SML which was suggested by van Benthem. In this logic one describes the progression along edges of a transition graph in alternation with moves of a saboteur who can delete edges. A drawback of the known results on SML is the asymmetry of the two modalities of ‘moving’ and ‘deleting’: Movements are local, whereas there is a global choice for edge deletion. To balance the situation and to obtain a more realistic model for traffic and network problems, we require that also the sabotage moves (edge deletions) are subject to a locality condition. We show that the new logic, called path sabotage logic PSL, already has the same complexities as SML (model checking, satisfiability) and that it lacks the finite model property. The main effort is finding a pruned form of SML-models that can be enforced within PSL and giving appropriate reductions from SML to PSL.
Philipp Rohde
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where CSL
Authors Philipp Rohde
Comments (0)