{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T11:00:50Z","timestamp":1768906850640,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642038150","type":"print"},{"value":"9783642038167","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_37","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T14:43:03Z","timestamp":1250692983000},"page":"427-438","source":"Crossref","is-referenced-by-count":4,"title":["On the Hybrid Extension of CTL and CTL\u2009+"],"prefix":"10.1007","author":[{"given":"Ahmet","family":"Kara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volker","family":"Weber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Lange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schwentick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"37_CR1","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1093\/jigpal\/8.5.653","volume":"8","author":"C. Areces","year":"2000","unstructured":"Areces, C., Blackburn, P., Marx, M.: The computational complexity of hybrid temporal logics. Logic Journal of the IGPL\u00a08(5), 653\u2013679 (2000)","journal-title":"Logic Journal of the IGPL"},{"issue":"3","key":"37_CR2","doi-asserted-by":"publisher","first-page":"977","DOI":"10.2307\/2695090","volume":"66","author":"C. Areces","year":"2001","unstructured":"Areces, C., Blackburn, P., Marx, M.: Hybrid logics: Characterization, interpolation and complexity. J. of Symbolic Logic\u00a066(3), 977\u20131010 (2001)","journal-title":"J. of Symbolic Logic"},{"key":"37_CR3","series-title":"Studies in Logic","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/S1570-2464(07)80017-6","volume-title":"Handbook of Modal Logic","author":"C. Areces","year":"2007","unstructured":"Areces, C., ten Cate, B.: Hybrid logics. In: Handbook of Modal Logic. Studies in Logic, vol.\u00a03, pp. 821\u2013868. Elsevier, Amsterdam (2007)"},{"issue":"3","key":"37_CR4","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0022-0000(86)90036-X","volume":"32","author":"B.S. Chlebus","year":"1986","unstructured":"Chlebus, B.S.: Domino-tiling games. J. Comput. Syst. Sci.\u00a032(3), 374\u2013392 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"E.M. Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol.\u00a0131, pp. 52\u201371. Springer, Heidelberg (1982)"},{"key":"37_CR6","first-page":"169","volume-title":"STOC 1982","author":"E.A. Emerson","year":"1982","unstructured":"Emerson, E.A., Halpern, J.Y.: Decision procedures and expressiveness in the temporal logic of branching time. In: STOC 1982, pp. 169\u2013180. ACM, New York (1982)"},{"issue":"1","key":"37_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E.A. Emerson","year":"1986","unstructured":"Emerson, E.A., Halpern, J.Y.: \u201cSometimes\u201d and \u201cnot never\u201d revisited: on branching versus linear time temporal logic. J. ACM\u00a033(1), 151\u2013178 (1986)","journal-title":"J. ACM"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-60207-8_7","volume-title":"Jewels are Forever","author":"J. Engelfriet","year":"1999","unstructured":"Engelfriet, J., Hoogeboom, H.J.: Tree-walking pebble automata. In: Jewels are Forever, pp. 72\u201383. Springer, Heidelberg (1999)"},{"key":"37_CR9","first-page":"192","volume-title":"TIME-ICTL 2003","author":"M. Franceschet","year":"2003","unstructured":"Franceschet, M., de Rijke, M., Schlingloff, B.-H.: Hybrid logics on linear structures: Expressivity and complexity. In: TIME-ICTL 2003, pp. 192\u2013202. IEEE, Los Alamitos (2003)"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Goranko, V.: Temporal logics with reference pointers and computation tree logics. Journal of Applied Non-Classical Logics\u00a010(3-4) (2000)","DOI":"10.1080\/11663081.2000.10510998"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Grohe, M., Schweikardt, N.: The succinctness of first-order logic on linear orders. Logical Methods in Computer Science\u00a01(1) (2005)","DOI":"10.2168\/LMCS-1(1:6)2005"},{"key":"37_CR12","volume-title":"Proc. of the 22nd LICS 2007","author":"M. Jurdzi\u0144ski","year":"2007","unstructured":"Jurdzi\u0144ski, M., Lazi\u0107, R.: Alternation-free mu-calculus for data trees. In: Proc. of the 22nd LICS 2007. IEEE, Los Alamitos (2007)"},{"key":"37_CR13","unstructured":"Kara, A., Weber, V., Lange, M., Schwentick, T.: On the hybrid extension of CTL and CTL\u2009+\u2009. arXiv:0906.2541 [cs.LO]"},{"key":"37_CR14","first-page":"25","volume-title":"Proc. of the 10th LICS 1995","author":"O. Kupferman","year":"1995","unstructured":"Kupferman, O., Pnueli, A.: Once and for all. In: Proc. of the 10th LICS 1995, pp. 25\u201335. IEEE, Los Alamitos (1995)"},{"key":"37_CR15","first-page":"265","volume-title":"Proc. of the 21st LICS 2006","author":"O. Kupferman","year":"2006","unstructured":"Kupferman, O., Vardi, M.Y.: Memoryful branching-time logic. In: Proc. of the 21st LICS 2006, pp. 265\u2013274. IEEE, Los Alamitos (2006)"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.ipl.2008.06.003","volume":"108","author":"M. Lange","year":"2008","unstructured":"Lange, M.: A purely model-theoretic proof of the exponential succinctness gap between CTL\u2009+\u2009 and CTL. Information Processing Letters\u00a0108, 308\u2013312 (2008)","journal-title":"Information Processing Letters"},{"issue":"2","key":"37_CR17","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0304-3975(95)00035-U","volume":"148","author":"F. Laroussinie","year":"1995","unstructured":"Laroussinie, F., Schnoebelen, P.: A hierarchy of temporal logics with past. Theor. Comput. Sci.\u00a0148(2), 303\u2013324 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"37_CR18","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1006\/inco.1999.2817","volume":"156","author":"F. Laroussinie","year":"2000","unstructured":"Laroussinie, F., Schnoebelen, P.: Specification in CTL+Past for verification in CTL. Inf. Comput.\u00a0156(1-2), 236\u2013263 (2000)","journal-title":"Inf. Comput."},{"key":"37_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L. Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)"},{"key":"37_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-45744-5_7","volume-title":"Automated Reasoning","author":"U. Sattler","year":"2001","unstructured":"Sattler, U., Vardi, M.Y.: The hybrid \u03bc-calculus. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, p. 76. Springer, Heidelberg (2001)"},{"key":"37_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-540-70918-3_48","volume-title":"STACS 2007","author":"T. Schwentick","year":"2007","unstructured":"Schwentick, T., Weber, V.: Bounded-variable fragments of hybrid logics. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 561\u2013572. Springer, Heidelberg (2007)"},{"key":"37_CR22","first-page":"251","volume-title":"Proc. of the 27th PODS 2008","author":"B. Cate ten","year":"2008","unstructured":"ten Cate, B., Segoufin, L.: XPath, transitive closure logic, and nested tree walking automata. In: Proc. of the 27th PODS 2008, pp. 251\u2013260. ACM, New York (2008)"},{"key":"37_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-69850-0_10","volume-title":"25 Years of Model Checking","author":"M.Y. Vardi","year":"2008","unstructured":"Vardi, M.Y.: From church and prior to PSL. In: Grumberg, O., Veith, H. (eds.) 25 Years of Model Checking. LNCS, vol.\u00a05000, pp. 150\u2013171. Springer, Heidelberg (2008)"},{"key":"37_CR24","unstructured":"Weber, V.: Hybrid branching-time logics. CoRR, abs\/0708.1723 (2007)"},{"key":"#cr-split#-37_CR25.1","doi-asserted-by":"crossref","unstructured":"Weber, V.: Branching-time logics repeatedly referring to states. Accepted to JoLLI (2009);","DOI":"10.1007\/s10849-009-9093-x"},{"key":"#cr-split#-37_CR25.2","unstructured":"An extended abstract appeared in the proceedings of HyLo 2007"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T02:33:51Z","timestamp":1558492431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}