{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:02Z","timestamp":1740099062952,"version":"3.37.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319955810"},{"type":"electronic","value":"9783319955827"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-95582-7_9","type":"book-chapter","created":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T10:31:17Z","timestamp":1531305077000},"page":"147-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Compound Interest in Relaxing Punctuality"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Ferr\u00e8re","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,12]]},"reference":[{"issue":"4","key":"9_CR1","first-page":"419","volume":"89","author":"PA Abdulla","year":"2008","unstructured":"Abdulla, P.A., Deneux, J., Ouaknine, J., Quaas, K., Worrell, J.: Universality analysis for one-clock timed automata. Fundam. Inform. 89(4), 419\u2013450 (2008)","journal-title":"Fundam. Inform."},{"issue":"2","key":"9_CR2","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.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9_CR3","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.A.: The benefits of relaxing punctuality. J. ACM 43(1), 116\u2013146 (1996)","journal-title":"J. ACM"},{"key":"9_CR4","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","author":"R Alur","year":"1992","unstructured":"Alur, R., Henzinger, T.A.: Logics and models of real time: a survey. In: de Bakker, J.W., Huizing, C., de Roever, W.P., Rozenberg, G. (eds.) REX 1991. LNCS, vol. 600, pp. 74\u2013106. Springer, Heidelberg (1992). \nhttps:\/\/doi.org\/10.1007\/BFb0031988"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-540-31954-2_5","volume-title":"Hybrid Systems: Computation and Control","author":"R Alur","year":"2005","unstructured":"Alur, R., La Torre, S., Madhusudan, P.: Perturbed timed automata. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 70\u201385. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/978-3-540-31954-2_5"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/506147.506151","volume":"49","author":"E Asarin","year":"2002","unstructured":"Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. J. ACM 49(2), 172\u2013206 (2002)","journal-title":"J. ACM"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-67531-2_6","volume-title":"Runtime Verification","author":"D Basin","year":"2017","unstructured":"Basin, D., Krsti\u0107, S., Traytel, D.: Almost event-rate independent monitoring of metric dynamic logic. In: Lahiri, S., Reger, G. (eds.) RV 2017. LNCS, vol. 10548, pp. 85\u2013102. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-67531-2_6"},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00236-015-0229-y","volume":"53","author":"MM Bersani","year":"2016","unstructured":"Bersani, M.M., Rossi, M., Pietro, P.S.: A tool for deciding the satisfiability of continuous-time metric temporal logic. Acta Informatica 53(2), 171\u2013206 (2016)","journal-title":"Acta Informatica"},{"key":"9_CR9","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). \nhttps:\/\/doi.org\/10.1007\/11590156_35"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-40229-6_4","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"T Brihaye","year":"2013","unstructured":"Brihaye, T., Esti\u00e9venart, M., Geeraerts, G.: On MITL and alternating timed automata. In: Braberman, V., Fribourg, L. (eds.) FORMATS 2013. LNCS, vol. 8053, pp. 47\u201361. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40229-6_4"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-10512-3_6","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"T Brihaye","year":"2014","unstructured":"Brihaye, T., Esti\u00e9venart, M., Geeraerts, G.: On MITL and alternating timed automata over infinite words. In: Legay, A., Bozga, M. (eds.) FORMATS 2014. LNCS, vol. 8711, pp. 69\u201384. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-10512-3_6"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-319-63387-9_21","volume-title":"Computer Aided Verification","author":"T Brihaye","year":"2017","unstructured":"Brihaye, T., Geeraerts, G., Ho, H.-M., Monmege, B.: MightyL: a compositional translation from MITL to timed automata. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 421\u2013440. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63387-9_21"},{"key":"9_CR13","first-page":"854","volume":"13","author":"G Giacomo De","year":"2013","unstructured":"De Giacomo, G., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. IJCAI 13, 854\u2013860 (2013)","journal-title":"IJCAI"},{"key":"9_CR14","series-title":"Integrated Circuits and Systems","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-36123-9","volume-title":"A Practical Introduction to PSL","author":"C Eisner","year":"2006","unstructured":"Eisner, C., Fisman, D.: A Practical Introduction to PSL. Integrated Circuits and Systems. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/978-0-387-36123-9"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"MJ Fischer","year":"1979","unstructured":"Fischer, M.J.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18(2), 194\u2013211 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-85778-5_9","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"CA Furia","year":"2008","unstructured":"Furia, C.A., Rossi, M.: MTL with bounded variability: decidability and complexity. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 109\u2013123. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-85778-5_9"},{"key":"9_CR17","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). \nhttps:\/\/doi.org\/10.1007\/BFb0055086"},{"key":"9_CR18","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). \nhttps:\/\/doi.org\/10.1007\/11821069_43"},{"key":"9_CR19","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). \nhttps:\/\/doi.org\/10.1007\/11753728_23"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. Automata Stud., 3\u201342 (1956)","DOI":"10.1515\/9781400882618-002"},{"issue":"4","key":"9_CR21","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 Syst. 2(4), 255\u2013299 (1990)","journal-title":"Real-Time Syst."},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-662-49630-5_20","volume-title":"Foundations of Software Science and Computation Structures","author":"SN Krishna","year":"2016","unstructured":"Krishna, S.N., Madnani, K., Pandya, P.K.: Metric temporal logic with counting. In: Jacobs, B., L\u00f6ding, C. (eds.) FoSSaCS 2016. LNCS, vol. 9634, pp. 335\u2013352. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49630-5_20"},{"key":"9_CR23","unstructured":"Krishna, S.N., Madnani, K., Pandya, P.K.: Making metric temporal logic rational. In: Mathematical Foundations of Computer Science, pp. 77:1\u201377:14 (2017)"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-540-31982-5_16","volume-title":"Foundations of Software Science and Computational Structures","author":"S Lasota","year":"2005","unstructured":"Lasota, S., Walukiewicz, I.: Alternating timed automata. In: Sassone, V. (ed.) FoSSaCS 2005. LNCS, vol. 3441, pp. 250\u2013265. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/978-3-540-31982-5_16"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/11603009_2","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"O Maler","year":"2005","unstructured":"Maler, O., Nickovic, D., Pnueli, A.: Real time temporal logic: past, present, future. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 2\u201316. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11603009_2"},{"key":"9_CR26","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. 4202, pp. 274\u2013289. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11867340_20"},{"issue":"110\/111","key":"9_CR27","first-page":"137","volume":"28","author":"M Michel","year":"1985","unstructured":"Michel, M.: Composition of temporal operators. Logique et Analyse 28(110\/111), 137\u2013152 (1985)","journal-title":"Logique et Analyse"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-15297-9_13","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"D Ni\u010dkovi\u0107","year":"2010","unstructured":"Ni\u010dkovi\u0107, D., Piterman, N.: From Mtl to deterministic timed automata. In: Chatterjee, K., Henzinger, T.A. (eds.) FORMATS 2010. LNCS, vol. 6246, pp. 152\u2013167. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15297-9_13"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-642-04081-8_33","volume-title":"CONCUR 2009 - Concurrency Theory","author":"J Ouaknine","year":"2009","unstructured":"Ouaknine, J., Rabinovich, A., Worrell, J.: Time-bounded verification. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 496\u2013510. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04081-8_33"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the decidability of metric temporal logic. In: Logic in Computer Science, pp. 188\u2013197. IEEE (2005)","DOI":"10.1109\/LICS.2005.33"},{"key":"9_CR31","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. LNCS, vol. 3921, pp. 217\u2013230. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11690634_15"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Foundations of Computer Science, pp. 46\u201357. IEEE (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-69850-0_11","volume-title":"25 Years of Model Checking","author":"A Pnueli","year":"2008","unstructured":"Pnueli, A., Zaks, A.: On the merits of temporal testers. In: Grumberg, O., Veith, H. (eds.) 25 Years of Model Checking. LNCS, vol. 5000, pp. 172\u2013195. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-69850-0_11"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-319-73721-8_22","volume-title":"In: Verification, Model Checking, and Abstract Interpretation","author":"N Roohi","year":"2018","unstructured":"Roohi, N., Viswanathan, M.: Revisiting MITL to fix decision procedures. In: Verification, Model Checking, and Abstract Interpretation. LNCS, vol. 10747, pp. 474\u2013494. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-73721-8_22"},{"key":"9_CR35","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"2006","unstructured":"Sipser, M.: Introduction to the Theory of Computation, vol. 2. Thomson Course Technology, Boston (2006)"},{"key":"9_CR36","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-540-92701-3_7","volume-title":"Logic and Its Applications","author":"MY Vardi","year":"2008","unstructured":"Vardi, M.Y.: From philosophical to industrial logics. In: Ramanujam, R., Sarukkai, Sundar (eds.) ICLA 2009. LNCS (LNAI), vol. 5378, pp. 89\u2013115. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-92701-3_7"},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/3-540-58468-4_191","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"T Wilke","year":"1994","unstructured":"Wilke, T.: Specifying timed state sequences in powerful decidable logics and timed automata. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994. LNCS, vol. 863, pp. 694\u2013715. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/3-540-58468-4_191"}],"container-title":["Lecture Notes in Computer Science","Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95582-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T10:37:41Z","timestamp":1531305461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-95582-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319955810","9783319955827"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95582-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}