{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:56:05Z","timestamp":1743148565817,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214993"},{"type":"electronic","value":"9783319215006"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_26","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"326-339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Path Checking for MTL and TPTL over Data Words"],"prefix":"10.1007","author":[{"given":"Shiguang","family":"Feng","sequence":"first","affiliation":[]},{"given":"Markus","family":"Lohrey","sequence":"additional","affiliation":[]},{"given":"Karin","family":"Quaas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1006\/inco.1993.1025","volume":"104","author":"R Alur","year":"1993","unstructured":"Alur, R., Henzinger, T.A.: Real-Time Logics: Complexity and Expressiveness. Inf. Comput. 104(1), 35\u201377 (1993)","journal-title":"Inf. Comput."},{"issue":"1","key":"26_CR2","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":"26_CR3","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Larsen, K.G., Markey. Model checking one-clock priced timed automata. Log. Meth. Comput. Sci. 4(2) (2008)","DOI":"10.2168\/LMCS-4(2:9)2008"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/978-3-662-43951-7_8","volume-title":"Automata, Languages, and Programming","author":"D Bundala","year":"2014","unstructured":"Bundala, D., Ouaknine, J.: On the complexity of temporal-logic path checking. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 86\u201397. Springer, Heidelberg (2014)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Carapelle, C., Feng, S., Gil, O.F., Quaas, K.: On the expressiveness of TPTL and MTL over $$\\omega $$-data words. In: Proc. AFL 2014. EPTCS, vol. 151, pp. 174\u2013187 (2014)","DOI":"10.4204\/EPTCS.151.12"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-319-04921-2_20","volume-title":"Language and Automata Theory and Applications","author":"C Carapelle","year":"2014","unstructured":"Carapelle, C., Feng, S., Fern\u00e1ndez Gil, O., Quaas, K.: Satisfiability for MTL and TPTL over non-monotonic data words. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 248\u2013259. Springer, Heidelberg (2014)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Demri, S., Lazi\u0107, R.: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. 10(3) (2009)","DOI":"10.1145\/1507244.1507246"},{"issue":"22\u201324","key":"26_CR8","doi-asserted-by":"publisher","first-page":"2298","DOI":"10.1016\/j.tcs.2010.02.021","volume":"411","author":"S Demri","year":"2010","unstructured":"Demri, S., Lazi\u0107, R., Sangnier, A.: Model checking memoryful linear-time logics over one-counter automata. Theor. Comput. Sci. 411(22\u201324), 2298\u20132316 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"26_CR9","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1006\/inco.1999.2846","volume":"160","author":"K Etessami","year":"2000","unstructured":"Etessami, K., Wilke, T.: An until hierarchy and other applications of an Ehrenfeucht-Fra\u00efss\u00e9 game for temporal logic. Inf. Comput. 160(1\u20132), 88\u2013108 (2000)","journal-title":"Inf. Comput."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Feng, S., Lohrey, M., Quaas, K.: Path-Checking for MTL and TPTL, arXiv.org (2014). 1412.3644","DOI":"10.1007\/978-3-319-21500-6_26"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-completeness Theory. Oxford University Press (1995)","DOI":"10.1093\/oso\/9780195085914.001.0001"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/S0022-0000(02)00025-9","volume":"65","author":"W Hesse","year":"2002","unstructured":"Hesse, W., Allender, E., Barrington, D.A.M.: Uniform constant-depth threshold circuits for division and iterated multiplication. J. Comput. System Sci. 65, 695\u2013716 (2002)","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"26_CR13","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01995674","volume":"2","author":"R Koymans","year":"1990","unstructured":"Koymans, R.: Specifying real-time properties with metric temporal logic. Real-Time Systems 2(4), 255\u2013299 (1990)","journal-title":"Real-Time Systems"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Kuhtz, L., Finkbeiner, B.: Efficient parallel path checking for linear-time temporal logic with past and bounds. Log. Meth. Comput. Sci. 8(4) (2012)","DOI":"10.2168\/LMCS-8(4:10)2012"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/3-540-45931-6_19","volume-title":"Foundations of Software Science and Computation Structures","author":"F Laroussinie","year":"2002","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: On model checking durational kripke structures. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 264\u2013279. Springer, Heidelberg (2002)"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11690634_15","volume-title":"Foundations of Software Science and Computation Structures","author":"J Ouaknine","year":"2006","unstructured":"Ouaknine, J., Worrell, J.B.: On metric temporal logic and faulty turing machines. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 217\u2013230. Springer, Heidelberg (2006)"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the decidability and complexity of metric temporal logic over finite words. Log. Meth. Comput. Sci. 3(1) (2007)","DOI":"10.2168\/LMCS-3(1:8)2007"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-642-37064-9_41","volume-title":"Language and Automata Theory and Applications","author":"K Quaas","year":"2013","unstructured":"Quaas, K.: Model checking metric temporal logic over automata with one counter. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 468\u2013479. Springer, Heidelberg (2013)"},{"issue":"1","key":"26_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.tcs.2006.08.017","volume":"369","author":"S Travers","year":"2006","unstructured":"Travers, S.: The complexity of membership problems for circuits over sets of integers. Theor. Comput. Sci. 369(1), 211\u2013229 (2006)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T04:18:35Z","timestamp":1675138715000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}