Complexity and Succinctness Issues for Linear-Time Hybrid Logics
Full linear-time hybrid logic (HL) is a non-elementary and equally expressive extension of standard LTL + past obtained by adding the well-known binder operators ↓ and ∃. We investigate complexity and succinctness issues for HL in terms of the number of variables and nesting depth of binder modalities. First, we present direct automata-theoretic decision procedures for satisfiability and model-checking of HL, which require space of exponential height equal to the nesting depth of binder modalities. The proposed algorithms are proved to be asymptotically optimal by providing matching lower bounds. Second, we show that for the one-variable fragment of HL, the considered problems are elementary and, precisely, Expspace-complete. Finally, we show that for all 0 ≤ h < k, there is a succinctness gap between the fragments HL k and HL h with binder nesting depth at most k and h, respectively, of exponential height equal to k − h.
KeywordsModel Check Binder Modality Acceptance Condition Kripke Structure Hybrid Logic
Unable to display preview. Download preview PDF.
- [BL08]Bozzelli, L., Lanotte, R.: Complexity and Succinctness issues for linear-time hybrid logics. Technical report (2008), http://dscpi.uninsubria.it/staff/Bozzelli
- [BS98]Blackburn, P., Seligman, J.: What are hybrid languages? In: Kracht, de Rijke, Wansing, Zakharyaschev (eds.) Advances in Modal Logic, vol. 1, pp. 41–62. CSLI Publications (1998)Google Scholar
- [Buc62]Buchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. Internat. Congr. Logic, Method. and Philos. Sci., Stanford, pp. 1–12 (1960)Google Scholar
- [FRS03]Franceschet, M., de Rijke, M., Schlingloff, B.H.: Hybrid logics on linear structures: Expressivity and complexity. In: Proc. 10th TIME, pp. 166–173. IEEE Computer Society Press, Los Alamitos (2003)Google Scholar
- [Pnu77]Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pp. 46–57 (1977)Google Scholar
- [Saf88]Safra, S.: On the complexity of omega-automata. In: Proc. 29th FOCS, pp. 319–327 (1988)Google Scholar
- [Sto74]Stockmeyer, L.J.: The complexity of decision problems in automata theory and logic. Ph.D. thesis, Department of Electrical Engineering. MIT, Cambridge (1974)Google Scholar
- [Var88]Vardi, M.Y.: A temporal fixpoint calculus. In: Proc. 15th Annual POPL, pp. 250–259. ACM Press, New York (1988)Google Scholar