{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T00:51:35Z","timestamp":1749084695785},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705826"},{"type":"electronic","value":"9783540705833"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70583-3_11","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"124-135","source":"Crossref","is-referenced-by-count":18,"title":["On Expressiveness and Complexity in Real-Time Model Checking"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Markey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00ebl","family":"Ouaknine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Worrell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.: A theory of timed automata. TCS\u00a0126(2), 183\u2013235 (1994)","journal-title":"TCS"},{"issue":"1","key":"11_CR2","first-page":"116","volume":"43","author":"R. Alur","year":"1996","unstructured":"Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. J.\u00a0of the\u00a0ACM\u00a043(1), 116\u2013146 (1996)","journal-title":"J.\u00a0of the\u00a0ACM"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/BFb0031988","volume-title":"Real-Time: Theory in Practice, Proc. REX Workshop\u00a01991","author":"R. Alur","year":"1992","unstructured":"Alur, R., Henzinger, T.A.: Logics and models of real time: A survey. In: Real-Time: Theory in Practice, Proc. REX Workshop\u00a01991. LNCS, vol.\u00a0600, pp. 74\u2013106. Springer, Heidelberg (1992)"},{"issue":"1","key":"11_CR4","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.\u00a0& Comp.\u00a0104(1), 35\u201377 (1993)","journal-title":"Inf.\u00a0& Comp."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Decision problems for timed automata: A survey. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol.\u00a03185, pp. 1\u201324. Springer, Heidelberg (2004)"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/LICS.2007.49","volume-title":"Proc. 22nd Ann. IEEE Symp. Logic in Computer Science (LICS 2007)","author":"P. Bouyer","year":"2007","unstructured":"Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: The cost of punctuality. In: Proc. 22nd Ann. IEEE Symp. Logic in Computer Science (LICS 2007), pp. 109\u2013118. IEEE, Los Alamitos (2007)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-44622-2_17","volume-title":"Computer Science Logic","author":"H. Comon","year":"2000","unstructured":"Comon, H., Cortier, V.: Flatness is not a weakness. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol.\u00a01862, pp. 262\u2013276. Springer, Heidelberg (2000)"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.ic.2006.08.003","volume":"205","author":"S. Demri","year":"2007","unstructured":"Demri, S., Lazi\u0107, R., Nowak, D.: On the freeze quantifier in constraint\u00a0LTL: Decidability and complexity. Inf.\u00a0& Comp.\u00a0205(1), 2\u201324 (2007)","journal-title":"Inf.\u00a0& Comp."},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/BFb0055640","volume-title":"CONCUR \u201998 Concurrency Theory","author":"T.A. Henzinger","year":"1998","unstructured":"Henzinger, T.A.: It\u2019s about time: Real-time logics reviewed. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 439\u2013454. Springer, Heidelberg (1998)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BFb0055086","volume-title":"Automata, Languages and Programming","author":"T.A. Henzinger","year":"1998","unstructured":"Henzinger, T.A., Raskin, J.-F., Schobbens, P.-Y.: The regular real-time languages. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 580\u2013591. Springer, Heidelberg (1998)"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.ic.2004.12.002","volume":"198","author":"Y. Hirshfeld","year":"2005","unstructured":"Hirshfeld, Y., Rabinovich, A.: Timer formulas and decidable metric temporal logic. Inf.\u00a0& Comp.\u00a0198(2), 148\u2013178 (2005)","journal-title":"Inf.\u00a0& Comp."},{"issue":"4","key":"11_CR12","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\u00a02(4), 255\u2013299 (1990)","journal-title":"Real-Time Systems"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","first-page":"413","volume-title":"Proc. Conference on Logics of Programs","author":"O. Lichtenstein","year":"1985","unstructured":"Lichtenstein, O., Pnueli, A., Zuck, L.D.: The glory of the past. In: Proc. Conference on Logics of Programs. LNCS, vol.\u00a0193, pp. 413\u2013424. Springer, Heidelberg (1985)"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ic.2006.08.006","volume":"205","author":"C. Lutz","year":"2007","unstructured":"Lutz, C., Walther, D., Wolter, F.: Quantitative temporal logics over the reals: PSPACE and below. Inf.\u00a0& Comp.\u00a0205(1), 99\u2013123 (2007)","journal-title":"Inf.\u00a0& Comp."},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/11867340_20","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"O. Maler","year":"2006","unstructured":"Maler, O., Nickovic, D., Pnueli, A.: From MITL to timed automata. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol.\u00a04202, pp. 274\u2013289. Springer, Heidelberg (2006)"},{"key":"11_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.: On metric temporal logic and faulty Turing machines. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006 and ETAPS 2006. LNCS, vol.\u00a03921, pp. 217\u2013230. Springer, Heidelberg (2006)"},{"key":"11_CR17","unstructured":"Raskin, J.-F.: Logics, Automata and Classical Theories for Deciding Real-Time. PhD thesis, Universit\u00e9 de Namur, Belgium (1999)"},{"key":"11_CR18","unstructured":"Reynolds, M.: The complexity of the temporal logic over the reals(submitted 2004)"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","first-page":"261","volume-title":"European Educational Forum: School on Formal Methods and Performance Analysis","author":"P. Wolper","year":"2000","unstructured":"Wolper, P.: Constructing automata from temporal logic formulas: A tutorial. In: European Educational Forum: School on Formal Methods and Performance Analysis. LNCS, vol.\u00a02090, pp. 261\u2013277. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:16:39Z","timestamp":1558264599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705826","9783540705833"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}