Moving Arrows and Four Model Checking Results
We study dynamic modal operators that can change the model during the evaluation of a formula. In particular, we extend the basic modal language with modalities that are able to swap, delete or add pairs of related elements of the domain, while traversing an edge of the accessibility relation. We study these languages together with the sabotage modal logic, which can arbitrarily delete edges of the model. We define a suitable notion of bisimulation for the basic modal logic extended with each of the new dynamic operators and investigate their expressive power, showing that they are all uncomparable. We also show that the complexity of their model checking problems is PSpace-complete.
KeywordsModel Check Modal Logic Dynamic Operator Expressive Power Accessibility Relation
Unable to display preview. Download preview PDF.
- 2.Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press (2001)Google Scholar
- 4.Blackburn, P., Wolter, F., van Benthem, J. (eds.): Handbook of Modal Logics. Elsevier (2006)Google Scholar
- 5.Gerbrandy, J.: Bisimulations on Planet Kripke. Ph.D. thesis, University of Amsterdam. ILLC Dissertation series DS-1999-01 (1999)Google Scholar
- 8.Papadimitriou, C.: Computational Complexity. Addison-Wesley (1994)Google Scholar
- 10.Rohde, P.: On games and logics over dynamically changing structures. Ph.D. thesis, RWTH Aachen (2006)Google Scholar
- 11.van Benthem, J.: Logics for information update. In: TARK 2001: Proceedings of the 8th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 51–67. Morgan Kaufmann Publishers Inc. (2001)Google Scholar
- 13.van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Kluwer (2007)Google Scholar
- 14.Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Lewis, H.R., Simons, B.B., Burkhard, W.A., Landweber, L.H. (eds.) STOC, pp. 137–146. ACM (1982)Google Scholar