Model checking and satisfiability for sabotage modal logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2914, Issue , 2003, Pages 302-313

  Löding, Christof ^a   Rohde, Philipp ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CRIME; FORMAL LOGIC; POLYNOMIAL APPROXIMATION; SOFTWARE ENGINEERING;

BISIMULATIONS; FINITE MODEL PROPERTY; MODEL-THEORETIC; POLYNOMIAL-TIME; PROGRAM COMPLEXITY; PSPACE-COMPLETE; SATISFIABILITY; SATISFIABILITY PROBLEMS;

MODEL CHECKING;

EID: 35248836931     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24597-1_26     Document Type: Article

References (6)

1. J. v. Benthem. An essay on sabotage and obstruction. In D. Hutter and S. Werner, editors, Festschrift in Honour of Prof. Jörg Siekmann, LNAI. Springer, 2002.
2. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press, 1995.
3. E. Grädel. Finite model theory and descriptive complexity. In Finite Model Theory and Its Applications. Springer, 2003. To appear.
4. J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 2001.
5. C. Löding and P. Rohde. Solving the sabotage game is PSPACE-hard. In Proceedings of MFCS 2003. Springer, 2003.
6. P. Schnoebelen. The complexity of temporal logic model checking. In Advances in Modal Logic - Proceedings of AiML'2002. World Scientific, 2003. To appear.