{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:30:50Z","timestamp":1725474650351},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540499947"},{"type":"electronic","value":"9783540499954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944836_35","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T23:48:02Z","timestamp":1164671282000},"page":"381-392","source":"Crossref","is-referenced-by-count":13,"title":["Safely Freezing LTL"],"prefix":"10.1007","author":[{"given":"Ranko","family":"Lazi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Schnoebelen, P.: The complexity of temporal logic model checking. In: AiML 2002. Advances in Modal Logic, vol.\u00a04, pp. 393\u2013436. King\u2019s College Publications (2003)"},{"key":"35_CR2","first-page":"147","volume-title":"TIME","author":"A. Lisitsa","year":"2005","unstructured":"Lisitsa, A., Potapov, I.: Temporal logic with predicate \u03bb-abstraction. In: TIME, pp. 147\u2013155. IEEE, Los Alamitos (2005)"},{"key":"35_CR3","first-page":"7","volume-title":"LICS","author":"M. Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS, pp. 7\u201316. IEEE, Los Alamitos (2006)"},{"key":"35_CR4","first-page":"10","volume-title":"PODS","author":"M. Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. In: PODS, pp. 10\u201319. ACM, New York (2006)"},{"key":"35_CR5","first-page":"188","volume-title":"LICS","author":"J. Ouaknine","year":"2005","unstructured":"Ouaknine, J., Worrell, J.: On the decidability of Metric temporal logic. In: LICS, pp. 188\u2013197. IEEE, Los Alamitos (2005)"},{"key":"35_CR6","first-page":"155","volume-title":"TIME-ICTL","author":"T. French","year":"2003","unstructured":"French, T.: Quantified propositional temporal logic with repeating states. In: TIME-ICTL, pp. 155\u2013165. IEEE, Los Alamitos (2003)"},{"key":"35_CR7","first-page":"113","volume-title":"TIME","author":"S. Demri","year":"2005","unstructured":"Demri, S., Lazi\u0107, R., Nowak, D.: On the freeze quantifier in constraint LTL: decidability and complexity. In: TIME, pp. 113\u2013121. IEEE, Los Alamitos (2005)"},{"key":"35_CR8","first-page":"17","volume-title":"LICS","author":"S. Demri","year":"2006","unstructured":"Demri, S., Lazi\u0107, R.: LTL with the freeze quantifier and register automata. In: LICS, pp. 17\u201326. IEEE, Los Alamitos (2006)"},{"issue":"2","key":"35_CR9","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M. Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. TCS\u00a0134(2), 329\u2013363 (1994)","journal-title":"TCS"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. In: ACM TOCL, vol.\u00a05(3), pp. 403\u2013435 (2004)","DOI":"10.1145\/1013560.1013562"},{"issue":"5","key":"35_CR11","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/BF01211865","volume":"6","author":"A.P. Sistla","year":"1994","unstructured":"Sistla, A.P.: Safety, liveness and fairness in temporal logic. Formal Aspects of Computing\u00a06(5), 495\u2013512 (1994)","journal-title":"Formal Aspects of Computing"},{"key":"35_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/11691372_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J. Ouaknine","year":"2006","unstructured":"Ouaknine, J., Worrell, J.B.: Safety metric temporal logic is fully decidable. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.\u00a03920, pp. 411\u2013425. Springer, Heidelberg (2006)"},{"key":"35_CR13","volume-title":"Classical Recursion Theory II","author":"P. Odifreddi","year":"1999","unstructured":"Odifreddi, P.: Classical Recursion Theory II. Elsevier, Amsterdam (1999)"},{"key":"35_CR14","unstructured":"David, C.: Mots et donn\u00e9es infinies. Master\u2019s thesis, LIAFA (2004)"},{"key":"35_CR15","unstructured":"Schnoebelen, P.: Deciding termination of ICMETs, Personal communication (2006)"},{"issue":"1","key":"35_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0304-3975(80)90069-9","volume":"10","author":"J.A. Brzozowski","year":"1980","unstructured":"Brzozowski, J.A., Leiss, E.L.: On equations for regular languages, finite automata, and sequential networks. TCS\u00a010(1), 19\u201335 (1980)","journal-title":"TCS"},{"issue":"1-2","key":"35_CR17","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transitions systems everywhere! TCS\u00a0256(1-2), 63\u201392 (2001)","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944836_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:17:50Z","timestamp":1619493470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944836_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499947","9783540499954"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11944836_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}