{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T18:25:23Z","timestamp":1790619923014,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662496299","type":"print"},{"value":"9783662496305","type":"electronic"}],"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_20","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T09:04:32Z","timestamp":1458551072000},"page":"335-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Metric Temporal Logic with Counting"],"prefix":"10.1007","author":[{"given":"Shankara Narayanan","family":"Krishna","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Khushraj","family":"Madnani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paritosh K.","family":"Pandya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Etessami, K., Wilke, T.: An until hierarchy for temporal logic. In: LICS, pp. 108\u2013117 (1996)","DOI":"10.1109\/LICS.1996.561310"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/11821069_43","volume-title":"Mathematical Foundations of Computer Science 2006","author":"Y Hirshfeld","year":"2006","unstructured":"Hirshfeld, Y., Rabinovich, A.: An expressive temporal logic for real time. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 492\u2013504. Springer, Heidelberg (2006)"},{"key":"20_CR3","unstructured":"Hunter, P.: When is metric temporal logic expressively complete? In: CSL, pp. 380\u2013394 (2013)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Krishna, S.N., Madnani, K., Pandya, P.K.: Partially punctual metric temporal logic is decidable. In: TIME, pp. 174\u2013183 (2014)","DOI":"10.1109\/TIME.2014.17"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-24310-3_16","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"DR Kini","year":"2011","unstructured":"Kini, D.R., Krishna, S.N., Pandya, P.K.: On construction of safety signal automata for $$MITL[\\,\\cal U\\mathit{,\\,\\cal S}]$$ M I T L [ U , S ] using temporal projections. In: Fahrenberg, U., Tripakis, S. (eds.) FORMATS 2011. LNCS, vol. 6919, pp. 225\u2013239. Springer, Heidelberg (2011)"},{"key":"20_CR6","unstructured":"Krishna, S.N., Madnani, K., Pandya, P.K.: Metric temporal logic with counting (2015). CoRR, abs\/1512.09032"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Laroussinie, F., Meyer, A., Petonnet, E.: Counting LTL. In: TIME, pp. 51\u201358 (2010)","DOI":"10.1109\/TIME.2010.20"},{"key":"20_CR8","unstructured":"Madnani, K., Krishna, S.N., Pandya, P.K.: Partially punctual metric temporal logic is decidable (2014). http:\/\/arxiv.org\/abs\/1404.6965"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the decidability of metric temporal logic. In: LICS, pp. 188\u2013197 (2005)","DOI":"10.1109\/LICS.2005.33"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-23217-6_5","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"PK Pandya","year":"2011","unstructured":"Pandya, P.K., Shah, S.S.: On expressive powers of timed logics: comparing boundedness, non-punctuality, and deterministic freezing. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 60\u201375. Springer, Heidelberg (2011)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/11867340_23","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P Prabhakar","year":"2006","unstructured":"Prabhakar, P., D\u2019Souza, D.: On the expressiveness of MTL with past operators. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 322\u2013336. Springer, Heidelberg (2006)"},{"issue":"22\u201324","key":"20_CR12","doi-asserted-by":"publisher","first-page":"2331","DOI":"10.1016\/j.tcs.2010.03.017","volume":"411","author":"A Rabinovich","year":"2010","unstructured":"Rabinovich, A.: Complexity of metric temporal logics with counting and the Pnueli modalities. Theoret. Comput. Sci. 411(22\u201324), 2331\u20132342 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR13","unstructured":"Raskin, J.F.: Logics, automata and classical theories for deciding real time. Ph.D. thesis, Universite de Namur (1999)"},{"key":"20_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0289-9","volume-title":"Finite Automata, Formal Logic and Circuit Complexity","author":"H Straubing","year":"1994","unstructured":"Straubing, H.: Finite Automata, Formal Logic and Circuit Complexity. Birkhauser, Boston (1994)"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T21:30:00Z","timestamp":1748813400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49630-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496299","9783662496305"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49630-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}