{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:25:09Z","timestamp":1742995509554,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030908690"},{"type":"electronic","value":"9783030908706"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-90870-6_10","type":"book-chapter","created":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T00:06:44Z","timestamp":1636502804000},"page":"182-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Generalizing Non-punctuality for Timed Temporal Logic with Freeze Quantifiers"],"prefix":"10.1007","author":[{"given":"Shankara Narayanan","family":"Krishna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khushraj","family":"Madnani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Manuel","family":"Mazo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paritosh K.","family":"Pandya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,10]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R Alur","year":"1996","unstructured":"Alur, R., Feder, T., Henzinger, T.: The benefits of relaxing punctuality. J. ACM 43(1), 116\u2013146 (1996)","journal-title":"J. ACM"},{"issue":"1","key":"10_CR2","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":"10_CR3","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\u2013203 (1994)","journal-title":"J. ACM"},{"key":"10_CR4","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. 3821, pp. 432\u2013443. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11590156_35"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-319-95582-7_9","volume-title":"Formal Methods","author":"T Ferr\u00e8re","year":"2018","unstructured":"Ferr\u00e8re, T.: The compound interest in relaxing punctuality. In: Havelund, K., Peleska, J., Roscoe, B., de Vink, E. (eds.) FM 2018. LNCS, vol. 10951, pp. 147\u2013164. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-95582-7_9"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-540-45138-9_38","volume-title":"Mathematical Foundations of Computer Science 2003","author":"P Gastin","year":"2003","unstructured":"Gastin, P., Oddoux, D.: LTL with past and two-way very-weak alternating automata. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 439\u2013448. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45138-9_38"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-1-84882-912-1_13","volume-title":"Reflections on the Work of C.A.R. Hoare","author":"C Haase","year":"2010","unstructured":"Haase, C., Ouaknine, J., Worrell, J.: On process-algebraic extensions of metric temporal logic. In: Roscoe, A.W., Jones, C.B., Wood, K.R. (eds.) Reflections on the Work of C.A.R. Hoare, pp. 283\u2013300. Springer, London (2010). https:\/\/doi.org\/10.1007\/978-1-84882-912-1_13"},{"key":"10_CR8","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":"TA 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. 1443, pp. 580\u2013591. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055086"},{"key":"10_CR9","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). https:\/\/doi.org\/10.1007\/11821069_43"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11753728_23","volume-title":"Computer Science \u2013 Theory and Applications","author":"Y Hirshfeld","year":"2006","unstructured":"Hirshfeld, Y., Rabinovich, A.: Expressiveness of metric modalities for continuous time. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 211\u2013220. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11753728_23"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Ho, H.-M.: Revisiting timed logics with automata modalities. In: Ozay, N., Prabhakar, P. (eds.) Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2019, Montreal, QC, Canada, 16\u201318 April 2019, pp. 67\u201376. ACM (2019)","DOI":"10.1145\/3302504.3311818"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Madnani, K., Krishna, S.N., Pandya, P.K.: Partially punctual metric temporal logic is decidable. In: TIME, pp. 174\u2013183 (2014)","DOI":"10.1109\/TIME.2014.17"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Krishna, S.N., Madnani, K., Mazo Jr., M., Pandya, P.K.: Generalizing non-punctuality for timed temporal logic with freeze quantifiers. CoRR, abs\/2105.09534 (2021)","DOI":"10.1007\/978-3-030-90870-6_10"},{"key":"10_CR14","unstructured":"Krishna, S.N., Madnani, K., Pandya, P.K.: Making metric temporal logic rational. In: Larsen, K.G., Bodlaender, H.L., Raskin, J.-F. (eds.) 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, 21\u201325 August 2017 - Aalborg, Denmark. LIPIcs, vol. 83, pp. 77:1\u201377:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"10_CR15","unstructured":"Krishna, S.N., Madnani, K., Pandya, P.K.: Logics meet 1-clock alternating timed automata. In: Schewe, S., Zhang, L. (eds.) 29th International Conference on Concurrency Theory, CONCUR 2018, 4\u20137 September 2018, Beijing, China. LIPIcs, vol. 118, pp. 39:1\u201339:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"10_CR16","unstructured":"Madnani, K.N.: On decidable extensions of metric temporal logic. Ph.D. thesis, Indian Institute of Technology Bombay, Mumbai, India (2019)"},{"key":"10_CR17","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":"10_CR18","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). https:\/\/doi.org\/10.1007\/978-3-642-23217-6_5"},{"key":"10_CR19","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). https:\/\/doi.org\/10.1007\/11867340_23"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Rabinovich, A.: Complexity of metric temporal logic with counting and pnueli modalities. In: FORMATS, pp. 93\u2013108 (2008)","DOI":"10.1007\/978-3-540-85778-5_8"},{"issue":"22\u201324","key":"10_CR21","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. Theor. Comput. Sci. 411(22\u201324), 2331\u20132342 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR22","unstructured":"Raskin, J.F.: Logics, automata and classical theories for deciding real time. Ph.D. thesis, Universite de Namur (1999)"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Wilke, T.: Specifying timed state sequences in powerful decidable logics and timed automata. In: Formal Techniques in Real-Time and Fault-Tolerant Systems, Third International Symposium Organized Jointly with the Working Group Provably Correct Systems - ProCoS, L\u00fcbeck, Germany, 19\u201323 September, Proceedings, pp. 694\u2013715 (1994)","DOI":"10.1007\/3-540-58468-4_191"}],"container-title":["Lecture Notes in Computer Science","Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90870-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T21:21:30Z","timestamp":1726089690000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90870-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030908690","9783030908706"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90870-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2021.csp.escience.cn\/dct\/page\/1","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"131","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Additionally, this includes 4 invited full papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}