Model checking for hybrid logics
Massimo Franceschet, Maarten de Rijke · UvA-DARE (University of Amsterdam) · 2003
We investigate the complexity of the model checking problem for hybrid logics. We provide model checkers for various hybrid fragments and we prove PSPACE-completeness for hybrid fragments including binders. We apply our findings to the problems of constraint verification for semistructured data and specification checking for mobile systems.