{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:59:08Z","timestamp":1776333548867,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642232169","type":"print"},{"value":"9783642232176","type":"electronic"}],"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-23217-6_5","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T13:14:02Z","timestamp":1314278042000},"page":"60-75","source":"Crossref","is-referenced-by-count":11,"title":["On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing"],"prefix":"10.1007","author":[{"given":"Paritosh K.","family":"Pandya","sequence":"first","affiliation":[]},{"given":"Simoni S.","family":"Shah","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.: Real Time Logics: Complexity and Expressiveness. In: Proceedings of LICS, pp. 390\u2013401 (1990)","DOI":"10.21236\/ADA323441"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T.: Back to the Future: Towards a Theory of Timed Regular Languages. In: Proceedings of FOCS, pp. 177\u2013186 (1992)","DOI":"10.1109\/SFCS.1992.267774"},{"key":"5_CR3","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.: Real Time Logics: Complexity and Expressiveness. Inf. and Comput.\u00a0104, 35\u201377 (1993)","journal-title":"Inf. and Comput."},{"issue":"1","key":"5_CR4","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 Really Temporal Logic. Jour. of the ACM\u00a041(1), 181\u2013204 (1994)","journal-title":"Jour. of the ACM"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Alur, R., Feder, Henzinger, T.: The Benefits of Relaxing Punctuality. Journal of the ACM\u00a043, 116\u2013146 (1996)","DOI":"10.1145\/227595.227602"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/11590156_35","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"P. Bouyer","year":"2005","unstructured":"Bouyer, P., Chevalier, F., Markey, N.: On the expressiveness of TPTL and MTL. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 432\u2013443. Springer, Heidelberg (2005)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: On expressiveness and complexity in real-time model checking. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 124\u2013135. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-70583-3_11"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-14455-4_15","volume-title":"Developments in Language Theory","author":"L. Dartois","year":"2010","unstructured":"Dartois, L., Kufleitner, M., Lauser, A.: Rankers over infinite words. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 148\u2013159. Springer, Heidelberg (2010)"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1006\/inco.2001.2953","volume":"179","author":"K. Etessami","year":"2002","unstructured":"Etessami, K., Vardi, M.Y., Wilke, T.: First-order logic with two variables and unary temporal logic. Inf. and Comput.\u00a0179, 279\u2013295 (2002)","journal-title":"Inf. and Comput."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Etessami, K., Wilke, T.: An Until Hierarchy for Temporal Logic. In: Proceedings of LICS, pp. 108\u2013117 (1996)","DOI":"10.1109\/LICS.1996.561310"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Immermann, N., Kozen, D.: Definability with Bounded Number of Bound Variables. Inf. and Comput., 121\u2013139 (1989)","DOI":"10.1016\/0890-5401(89)90055-2"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: Some recent results in metric temporal logic. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol.\u00a05215, pp. 1\u201313. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-85778-5_1"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-15297-9_14","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P.K. Pandya","year":"2010","unstructured":"Pandya, P.K., Shah, S.S.: Unambiguity in timed regular languages: Automata and logics. In: Chatterjee, K., Henzinger, T.A. (eds.) FORMATS 2010. LNCS, vol.\u00a06246, pp. 168\u2013182. Springer, Heidelberg (2010)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Pandya, P.K., Shah, S.S.: On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing. CoRR, abs\/1102.5638 (2011)","DOI":"10.1007\/978-3-642-23217-6_5"},{"key":"5_CR15","unstructured":"Raskin, J.-F.: Logics, Automata and Classical Theories for Deciding Real Time. Ph.D. Thesis, Univ. of Namur, Belgium (1999)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Thomas, W.: On The Ehrenfeucht-Fra\u00efss\u00e9 Game in Theoretical Computer Science. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 559\u2013568. Springer, Heidelberg (1993)","DOI":"10.1007\/3-540-56610-4_89"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2011 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23217-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T11:45:05Z","timestamp":1560512705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23217-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232169","9783642232176"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23217-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}