On the μ-Calculus Augmented with Sabotage
We study logics and games over dynamically changing structures. Van Benthem’s sabotage modal logic consists of modal logic with a cross-model modality referring to submodels from which a transition has been removed. We add constructors for forming least and greatest monadic fixed-points to that logic and obtain the sabotage μ-calculus. We introduce backup parity games as an extension of standard parity games where in addition, both players are able to delete edges of the arena and to store, resp., restore the current appearance of the arena by use of a fixed number of registers. We show that these games serve as model checking games for the sabotage μ-calculus, even if the access to registers follows a stack discipline. The problem of solving the games with restricted register access turns out to be PSPACE-complete while the more general games without a limited access become EXPTIME-complete (for at least three registers).
KeywordsModel Check Modal Logic Polynomial Space Kripke Structure Tree Automaton
- 4.Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: FOCS 1991, pp. 368–377 (1991)Google Scholar
- 10.Rohde, P.: On Games and Logics over Dynamically Changing Structures. Technical report submitted as dissertation thesis at RWTH Aachen, Available under (2005), www-i7.informatik.rwth-aachen.de/~rohde/thesis.pdf
- 12.Vardi, M.Y.: The complexity of relational query languages. In: STOC 1983, pp. 137–146 (1982)Google Scholar
- 13.Vardi, M.Y.: On the complexity of bounded-variable queries. In: PODS 1995, pp. 266–276 (1995)Google Scholar