{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:15:33Z","timestamp":1725747333048},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642410352"},{"type":"electronic","value":"9783642410369"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41036-9_8","type":"book-chapter","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T09:49:49Z","timestamp":1378201789000},"page":"70-82","source":"Crossref","is-referenced-by-count":4,"title":["Deciding Continuous-Time Metric Temporal Logic with Counting Modalities"],"prefix":"10.1007","author":[{"given":"Marcello M.","family":"Bersani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierluigi San","family":"Pietro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"qtlsolver, \n                  \n                    http:\/\/qtlsolver.googlecode.com"},{"key":"8_CR2","unstructured":"Zot: a bounded satisfiability checker, \n                  \n                    http:\/\/zot.googlecode.com"},{"issue":"2","key":"8_CR3","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. Theoretical Computer Science\u00a0126(2), 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"8_CR4","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"},{"key":"8_CR5","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press (2008)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-24288-5_7","volume-title":"Reachability Problems","author":"M.M. Bersani","year":"2011","unstructured":"Bersani, M.M., Frigeri, A., Rossi, M., San Pietro, P.: Completeness of the bounded satisfiability problem for constraint LTL. In: Delzanno, G., Potapov, I. (eds.) RP 2011. LNCS, vol.\u00a06945, pp. 58\u201371. Springer, Heidelberg (2011)"},{"key":"8_CR7","unstructured":"Bersani, M.M., Rossi, M., San Pietro, P.: On the satisfiability of metric temporal logics over the reals. In: Proceedings of AVOCS (2013)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Bersani, M.M., Rossi, M., San Pietro, P.: A tool for deciding the satisfiability of continuous-time metric temporal logic. In: Proceedings of TIME (2013)","DOI":"10.1109\/TIME.2013.20"},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.ic.2006.09.006","volume":"205","author":"S. Demri","year":"2007","unstructured":"Demri, S., D\u2019Souza, D.: An automata-theoretic approach to constraint LTL. Inf. Comput.\u00a0205(3), 380\u2013415 (2007)","journal-title":"Inf. Comput."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Furia, C.A., Mandrioli, D., Morzenti, A., Rossi, M.: Modeling Time in Computing. EATCS Monographs in Theoretical Computer Science. Springer (2012)","DOI":"10.1007\/978-3-642-32332-4"},{"issue":"2","key":"8_CR11","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.ic.2004.12.002","volume":"198","author":"Y. Hirshfeld","year":"2005","unstructured":"Hirshfeld, Y., Rabinovich, A.: Timer formulas and decidable metric temporal logic. Information and Computation\u00a0198(2), 148\u2013178 (2005)","journal-title":"Information and Computation"},{"issue":"1:3","key":"8_CR12","first-page":"1","volume":"3","author":"Y. Hirshfeld","year":"2007","unstructured":"Hirshfeld, Y., Rabinovich, A.: Expressiveness of metric modalities for continuous time. Logical Methods in Computer Science\u00a03(1:3), 1\u201311 (2007)","journal-title":"Logical Methods in Computer Science"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2011.11.003","volume":"214","author":"Y. Hirshfeld","year":"2012","unstructured":"Hirshfeld, Y., Rabinovich, A.: Continuous time temporal logic with counting. Information and Computation\u00a0214, 1\u20139 (2012)","journal-title":"Information and Computation"},{"key":"8_CR14","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)"},{"key":"8_CR15","unstructured":"Microsoft Research. Z3: An efficient SMT solver"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/174634.174636","volume":"3","author":"A. Morzenti","year":"1994","unstructured":"Morzenti, A., San Pietro, P.: Object-oriented logical specification of time-critical systems. ACM TOSEM\u00a03(1), 56\u201398 (1994)","journal-title":"ACM TOSEM"},{"key":"8_CR17","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. Theoretical Computer Science\u00a0411, 2331\u20132342 (2010)","journal-title":"Theoretical Computer Science"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BFb0014711","volume-title":"Hybrid and Real-Time Systems","author":"J.-F. Raskin","year":"1997","unstructured":"Raskin, J.-F., Schobbens, P.-Y.: State clock logic: a decidable real-time logic. In: Maler, O. (ed.) HART 1997. LNCS, vol.\u00a01201, pp. 33\u201347. Springer, Heidelberg (1997)"},{"issue":"1-2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(00)00308-X","volume":"274","author":"J.-F. Raskin","year":"2002","unstructured":"Raskin, J.-F., Schobbens, P.-Y., Henzinger, T.A.: Axioms for real-time logics. Theoretical Computer Science\u00a0274(1-2), 151\u2013182 (2002)","journal-title":"Theoretical Computer Science"},{"key":"8_CR20","unstructured":"The UPPAAL model checker, \n                  \n                    http:\/\/www.uppaal.org"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41036-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T01:26:08Z","timestamp":1558056368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41036-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410352","9783642410369"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41036-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}