{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:25:41Z","timestamp":1725585941275},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642221187"},{"type":"electronic","value":"9783642221194"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22119-4_7","type":"book-chapter","created":{"date-parts":[[2011,6,15]],"date-time":"2011-06-15T14:21:08Z","timestamp":1308147668000},"page":"58-72","source":"Crossref","is-referenced-by-count":2,"title":["Hybrid and First-Order Complete Extensions of CaRet"],"prefix":"10.1007","author":[{"given":"Laura","family":"Bozzelli","sequence":"first","affiliation":[]},{"given":"Ruggero","family":"Lanotte","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Arenas, M., Barcelo, P., Etessami, K., Immerman, N., Libkin, L.: First-order and temporal logics for nested words. Logical Methods in Computer Science\u00a04(4) (2008)","DOI":"10.2168\/LMCS-4(4:11)2008"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-540-24730-2_35","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Alur","year":"2004","unstructured":"Alur, R., Etessami, K., Madhusudan, P.: A temporal logic of nested calls and returns. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 467\u2013481. Springer, Heidelberg (2004)"},{"key":"7_CR3","first-page":"202","volume-title":"Proc. 36th STOC","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proc. 36th STOC, pp. 202\u2013211. ACM, New York (2004)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11779148_1","volume-title":"Developments in Language Theory","author":"R. Alur","year":"2006","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 1\u201313. Springer, Heidelberg (2006)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR\u201997: Concurrency Theory","author":"A. Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability Analysis of Pushdown Automata: Application to Model-Checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"key":"7_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-87803-2_6","volume-title":"Logics in Artificial Intelligence","author":"L. Bozzelli","year":"2008","unstructured":"Bozzelli, L., Lanotte, R.: Complexity and succinctness issues for linear-time hybrid logics. In: H\u00f6lldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol.\u00a05293, pp. 48\u201361. Springer, Heidelberg (2008)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Bozzelli, L., Lanotte, R.: Hybrid and first-order complete extensions of CARET. Technical report - (2011), http:\/\/dscpi.uninsubria.it\/staff\/Lanotte","DOI":"10.1007\/978-3-642-22119-4_7"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-540-74407-8_32","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"L. Bozzelli","year":"2007","unstructured":"Bozzelli, L.: Alternating automata and a temporal fixpoint calculus for visibly pushdown languages. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 476\u2013491. Springer, Heidelberg (2007)"},{"key":"7_CR9","series-title":"ENTCS","volume-title":"Proc. 5th Workshop on Methods for Modalities","author":"L. Bozzelli","year":"2008","unstructured":"Bozzelli, L.: Caret with forgettable past. In: Proc. 5th Workshop on Methods for Modalities. ENTCS. Elsevier, Amsterdam (2008)"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.jal.2005.06.010","volume":"4","author":"M. Franceschet","year":"2006","unstructured":"Franceschet, M., de Rijke, M.: Model checking hybrid logics (with an application to semistructured data). J. Applied Logic\u00a04(3), 279\u2013304 (2006)","journal-title":"J. Applied Logic"},{"key":"7_CR11","first-page":"166","volume-title":"Proc. 10th TIME","author":"M. Franceschet","year":"2003","unstructured":"Franceschet, M., de Rijke, M., Schlingloff, B.H.: Hybrid logics on linear structures: Expressivity and complexity. In: Proc. 10th TIME, pp. 166\u2013173. IEEE Computer Society, Los Alamitos (2003)"},{"key":"7_CR12","first-page":"383","volume-title":"Proc. 17th LICS","author":"F. Laroussinie","year":"2002","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: Temporal logic with forgettable past. In: Proc. 17th LICS, pp. 383\u2013392. IEEE Comp. Soc. Press, Los Alamitos (2002)"},{"issue":"2","key":"7_CR13","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. Theoretical Computer Science\u00a0148(2), 303\u2013324 (1995)","journal-title":"Theoretical Computer Science"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(84)90049-5","volume":"32","author":"S. Miyano","year":"1984","unstructured":"Miyano, S., Hayashi, T.: Alternating finite automata on \u03c9-words. Theoretical Computer Science\u00a032, 321\u2013330 (1984)","journal-title":"Theoretical Computer Science"},{"key":"7_CR15","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":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-44667-2_7","volume-title":"Lectures on Formal Methods and Performance Analysis","author":"P. Wolper","year":"2001","unstructured":"Wolper, P.: Constructing automata from temporal logic formulas: A tutorial. In: Brinksma, E., Hermanns, H., Katoen, J.-P. (eds.) EEF School 2000 and FMPA 2000. LNCS, vol.\u00a02090, pp. 261\u2013277. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22119-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T19:44:40Z","timestamp":1560282280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22119-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642221187","9783642221194"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22119-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}