{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:28:59Z","timestamp":1742923739143,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662242"},{"type":"electronic","value":"9783540485230"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48523-6_39","type":"book-chapter","created":{"date-parts":[[2007,12,10]],"date-time":"2007-12-10T12:06:31Z","timestamp":1197288391000},"page":"422-432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A Framework for Decidable Metrical Logics"],"prefix":"10.1007","author":[{"given":"Yoram","family":"Hirshfeld","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Rabinovich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,1,18]]},"reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur, D. Dill A theory of timed Automata. Theoretical Computer Science 126 (1994), 183\u2013235.","journal-title":"Theoretical Computer Science"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R. Alur","year":"1996","unstructured":"R. Alur, T. Feder, T.A. Henzinger. The Benefits of Relaxing Punctuality. Journal of the ACM 43 (1996) 116\u2013146.","journal-title":"Journal of the ACM"},{"key":"39_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/BFb0031988","volume-title":"Real Time: Theory and Practice","author":"R. Alur","year":"1992","unstructured":"R. Alur, T.A. Henzinger. Logics and Models of Real Time: a survey. In Real Time: Theory and Practice. Editors de Bakker et al. LNCS 600 (1992) 74\u2013106."},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.4064\/fm-49-2-129-141","volume":"49","author":"A. Ehrenfeucht","year":"1961","unstructured":"A. Ehrenfeucht. An application of games to the completeness problem for formalized theories. Fundamenta mathematicae 49,129\u2013141,1961.","journal-title":"Fundamenta mathematicae"},{"key":"39_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013976","volume-title":"Temporal Logics","author":"D.M. Gabbay","year":"1994","unstructured":"D.M. Gabbay, I. Hodkinson, M. Reynolds. Temporal Logics volume 1. Clarendon Press, Oxford (1994)."},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger, J.F. Raskin, P.Y. Schobbens. The Regular Real Time Languages. 25th ICALP (1998).","DOI":"10.1007\/BFb0055086"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Y. Hirshfeld and A. Rabinovich Quantitative Temporal Logic. Submitted, 1998.","DOI":"10.1007\/3-540-48168-0_13"},{"key":"39_CR8","unstructured":"H. Kamp. Tense Logic and the Theory of Linear Order. Ph.D. thesis, University of California L.A. (1968)."},{"key":"39_CR9","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"M.O. Rabin, Decidability of second order theories and automata on infinite trees. In Trans. Amer. Math. Soc.,141,pp 1\u201335, 1969.","journal-title":"Trans. Amer. Math. Soc."},{"issue":"5","key":"39_CR10","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1093\/logcom\/8.5.669","volume":"8","author":"A. Rabinovich","year":"1998","unstructured":"A. Rabinovich. On the Decidability of Continuous Time Specification Formalisms. Journal of Logic and Computation vol.8 No. 5, (1998) pp 669\u2013678.","journal-title":"Journal of Logic and Computation"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"A. Rabinovich. On Expressive Completeness of Duration and Mean Value Calculi. Proceedings of Express 97. In the Electronic Notes of Theoretical Computer Science vol 7, 1997.","DOI":"10.1016\/S1571-0661(05)80476-1"},{"key":"39_CR12","unstructured":"A. Rabinovich. Expressive Completeness of Duration Calculus. To appear in Journal of Information and Computation."},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"A. Ravn, H. Rischel and K. Hansen. Specifying and verifying requirement of real time systems. IEEE Transaction on Software Eng., 1993.","DOI":"10.1109\/32.210306"},{"key":"39_CR14","doi-asserted-by":"publisher","first-page":"349","DOI":"10.2307\/1971037","volume":"102","author":"S. Shelah","year":"1975","unstructured":"S. Shelah. The monadic theory of order. Ann. of Math., 102, pp 349\u2013419, 1975.","journal-title":"Ann. of Math."},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"J. Skakk\u00e6bak, A. Ravn, H. Rischel, Zhou Chaochen. Specification of Embedded Real time Systems. In Proc. of 1992 Euromicro workshop on Real Time Systems. IEEE Computer Society Press.","DOI":"10.1109\/EMWRT.1992.637481"},{"issue":"5","key":"39_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0020-0190(91)90122-X","volume":"40","author":"Z. Chaochen","year":"1991","unstructured":"Zhou Chaochen, C.A.R. Hoare and A. Ravn. A calculus of Duration. Information processing Letters, 40(5):269\u2013279, 1991.","journal-title":"Information processing Letters"},{"key":"39_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/3-540-58468-4_191","volume-title":"Formal Techniques in Real Time and Fault Tolerance Systems","author":"T. Wilke","year":"1994","unstructured":"T. Wilke. Specifying Time State Sequences in Powerful Decidable Logics and Time Automata. In Formal Techniques in Real Time and Fault Tolerance Systems. LNCS 863 (1994), 694\u2013715."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48523-6_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,22]],"date-time":"2022-01-22T03:08:23Z","timestamp":1642820903000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-48523-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662242","9783540485230"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-48523-6_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"18 January 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}