{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:47Z","timestamp":1760202707467},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662496299"},{"type":"electronic","value":"9783662496305"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49630-5_16","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T09:04:32Z","timestamp":1458551072000},"page":"269-284","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Freeze LTL with Ordered Attributes"],"prefix":"10.1007","author":[{"given":"Normann","family":"Decker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Thoma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/174644.174651","volume":"41","author":"R Alur","year":"1994","unstructured":"Alur, R., Henzinger, T.A.: A really temporal logic. J. ACM 41(1), 181\u2013204 (1994)","journal-title":"J. ACM"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1007\/978-3-540-74456-6_66","volume-title":"Mathematical Foundations of Computer Science 2007","author":"H Bj\u00f6rklund","year":"2007","unstructured":"Bj\u00f6rklund, H., Boja\u0144czyk, M.: Shuffle expressions and words with nested data. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 750\u2013761. Springer, Heidelberg (2007)"},{"issue":"4","key":"16_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1970398.1970403","volume":"12","author":"M Bojanczyk","year":"2011","unstructured":"Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Trans. Comput. Log. 12(4), 27 (2011)","journal-title":"ACM Trans. Comput. Log."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Chambart, P., Schnoebelen, P.: The ordinal recursive complexity of lossy channel systems. In: LICS 2008, IEEE Symposium on Logic in Computer Science, IEEE Computer Society (2008)","DOI":"10.1109\/LICS.2008.47"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/978-3-662-44584-6_34","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"N Decker","year":"2014","unstructured":"Decker, N., Habermehl, P., Leucker, M., Thoma, D.: Ordered navigation on multi-attributed data\u00a0words. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 497\u2013511. Springer, Heidelberg (2014)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Demri, S., Figueira, D., Praveen, M.: Reasoning about data repetitions with counter systems. In: LICS 2013, ACM\/IEEE Symposium on Logic in Computer Science, IEEE Computer Society (2013)","DOI":"10.1109\/LICS.2013.8"},{"issue":"3","key":"16_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1507244.1507246","volume":"10","author":"St\u00e9phane Demri","year":"2009","unstructured":"Demri, S., Lazic, R.: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. 10(3) (2009)","journal-title":"ACM Transactions on Computational Logic"},{"key":"16_CR8","unstructured":"Demri, S., Lazic, R., Nowak, D.: On the freeze quantifier in constraint LTL: decidability and complexity. In: International Symposium on Temporal Representation and Reasoning (TIME 2005), IEEE Computer Society (2005)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Figueira, D.: Alternating register automata on finite words and trees. Log. Meth. Comput. Sci. 8(1) (2012)","DOI":"10.2168\/LMCS-8(1:22)2012"},{"issue":"6","key":"16_CR10","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1093\/logcom\/12.6.1017","volume":"12","author":"M Fitting","year":"2002","unstructured":"Fitting, M.: Modal logics between propositional and first-order. J. Log. Comput. 12(6), 1017\u20131026 (2002)","journal-title":"J. Log. Comput."},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00215625","volume":"5","author":"V Goranko","year":"1996","unstructured":"Goranko, V.: Hierarchies of modal and temporal logics with reference pointers. J. Logic Lang. Inf. 5(1), 1\u201324 (1996)","journal-title":"J. Logic Lang. Inf."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Haase, C., Schmitz, S., Schnoebelen, P.: The power of priority channel systems. Logical Meth. Comput. Sci. 10(4) (2014)","DOI":"10.2168\/LMCS-10(4:4)2014"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A.: Half-order modal logic: how to prove real-time properties. In: ACM Symposium on Principles of Distributed Computing, ACM (1990)","DOI":"10.1145\/93385.93429"},{"key":"16_CR14","unstructured":"Kara, A., Schwentick, T., Zeume, T.: Temporal logics on words with multiple data values. In: FSTTCS 2010, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2010)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/11944836_35","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"RS Lazi\u0107","year":"2006","unstructured":"Lazi\u0107, R.S.: Safely freezing LTL. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 381\u2013392. Springer, Heidelberg (2006)"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Leroux, J., Schmitz, S.: Reachability in vector addition systems demystified. In: LICS 2015, ACM\/IEEE Symposium on Logic in Computer Science, IEEE Computer Society (2015)","DOI":"10.1109\/LICS.2015.16"},{"key":"16_CR17","unstructured":"Lisitsa, A., Potapov, I.: Temporal logic with predicate lambda-abstraction. In: International Symposium on Temporal Representation and Reasoning (TIME 2005), IEEE Computer Society (2005)"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-46562-6_18","volume-title":"Perspectives of System Informatics","author":"IA Lomazova","year":"2000","unstructured":"Lomazova, I.A., Schnoebelen, P.: Some decidability results for nested petri nets. In: Bjorner, D., Broy, M., Zamulin, A.V. (eds.) PSI 1999. LNCS, vol. 1755, pp. 208\u2013220. Springer, Heidelberg (2000)"},{"key":"16_CR19","unstructured":"Rosa-Velardo, F.: Ordinal recursive complexity of unordered data nets. Technical report TR-4-14, Departamento de Sistemas Inform\u00e1ticos y Computaci\u00f3n, Universidad Complutense de Madrid (2014)"},{"key":"16_CR20","unstructured":"Schmitz, S.: Complexity hierarchies beyond elementary. CoRR abs\/1312.5686 (2013). \n                      http:\/\/arxiv.org\/abs\/1312.5686"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-15155-2_54","volume-title":"Mathematical Foundations of Computer Science 2010","author":"P Schnoebelen","year":"2010","unstructured":"Schnoebelen, P.: Revisiting Ackermann-Hardness for lossy counter machines and reset petri nets. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 616\u2013628. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49630-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T01:07:11Z","timestamp":1585012031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49630-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496299","9783662496305"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49630-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}