{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:29:52Z","timestamp":1725517792689},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857778"},{"type":"electronic","value":"9783540857785"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85778-5_9","type":"book-chapter","created":{"date-parts":[[2008,8,29]],"date-time":"2008-08-29T17:32:04Z","timestamp":1220031124000},"page":"109-123","source":"Crossref","is-referenced-by-count":7,"title":["MTL with Bounded Variability: Decidability and Complexity"],"prefix":"10.1007","author":[{"given":"Carlo A.","family":"Furia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"9_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.A.: The benefits of relaxing punctuality. Journal of the ACM\u00a043(1), 116\u2013146 (1996)","journal-title":"Journal of the ACM"},{"issue":"1","key":"9_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. Information and Computation\u00a0104(1), 35\u201377 (1993)","journal-title":"Information and Computation"},{"issue":"2","key":"9_CR3","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. Journal of the ACM\u00a049(2), 172\u2013206 (2002)","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: The cost of punctuality. In: Proceedings of LICS 2007 (2007)","key":"9_CR4","DOI":"10.1109\/LICS.2007.49"},{"issue":"1","key":"9_CR5","first-page":"1","volume":"9","author":"D. D\u2019Souza","year":"2007","unstructured":"D\u2019Souza, D., Prabhakar, P.: On the expressiveness of MTL in the pointwise and continuous semantics. Formal Methods Letters\u00a09(1), 1\u20134 (2007)","journal-title":"Formal Methods Letters"},{"unstructured":"M.\u00a0Fr\u00e4nzle. Decidability of duration calculi on restricted model classes. Technical Report Kiel MF 21\/1, Christian-Albrechts Universit\u00e4t Kiel (1996)","key":"9_CR6"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-68237-0_11","volume-title":"FM 2008: Formal Methods","author":"C.A. Furia","year":"2008","unstructured":"Furia, C.A., Pradella, M., Rossi, M.: Automated verification of dense-time MTL specifications via discrete-time approximation. In: Cuellar, J., Maibaum, T.S.E. (eds.) FM 2008. LNCS, vol.\u00a05014, pp. 132\u2013147. Springer, Heidelberg (2008)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11867340_16","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"C.A. Furia","year":"2006","unstructured":"Furia, C.A., Rossi, M.: Integrating discrete- and continuous-time metric temporal logics through sampling. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol.\u00a04202, pp. 215\u2013229. Springer, Heidelberg (2006)"},{"unstructured":"Furia, C.A., Rossi, M.: MTL with bounded variability: Decidability and complexity. Technical report, DEI, Politecnico di Milano (May 2008)","key":"9_CR9"},{"key":"9_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0013976","volume-title":"Temporal Logic","author":"D.M. Gabbay","year":"1994","unstructured":"Gabbay, D.M., Hodkinson, I., Reynolds, M.: Temporal Logic, vol.\u00a01. Oxford University Press, Oxford (1994)"},{"issue":"1","key":"9_CR11","first-page":"1","volume":"62","author":"Y. Hirshfeld","year":"2004","unstructured":"Hirshfeld, Y., Rabinovich, A.M.: Logics for real time: Decidability and complexity. Fundamenta Informaticae\u00a062(1), 1\u201328 (2004)","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"9_CR12","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. Information and Computation\u00a0205(1), 99\u2013123 (2007)","journal-title":"Information and Computation"},{"key":"9_CR13","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)"},{"doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the decidability and complexity of metric temporal logic over finite words. Logical Methods in Computer Science\u00a03(1) (2007)","key":"9_CR14","DOI":"10.2168\/LMCS-3(1:8)2007"},{"issue":"5","key":"9_CR15","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/j.ic.2006.11.002","volume":"205","author":"A. Rabinovich","year":"2007","unstructured":"Rabinovich, A.: Temporal logics with incommensurable distances are undecidable. Information and Computation\u00a0205(5), 707\u2013715 (2007)","journal-title":"Information and Computation"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of FORMATS 2008","author":"A.M. Rabinovich","year":"2008","unstructured":"Rabinovich, A.M.: Complexity of metric temporal logic with counting. In: Proceedings of FORMATS 2008. LNCS. Springer, Heidelberg (2008)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a0863, pp. 694\u2013715. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85778-5_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:49:25Z","timestamp":1619524165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85778-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540857778","9783540857785"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85778-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}