{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:45Z","timestamp":1760202525563},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377917"},{"type":"electronic","value":"9783540377931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11821069_43","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T10:25:12Z","timestamp":1156501512000},"page":"492-504","source":"Crossref","is-referenced-by-count":12,"title":["An Expressive Temporal Logic for Real Time"],"prefix":"10.1007","author":[{"given":"Yoram","family":"Hirshfeld","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Rabinovich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_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, 116\u2013146 (1996)","journal-title":"Journal of the ACM"},{"key":"43_CR2","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: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol.\u00a0600, pp. 74\u2013106. Springer, Heidelberg (1992)"},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0022-0000(78)90049-1","volume":"16","author":"J.A. Brzozowski","year":"1978","unstructured":"Brzozowski, J.A., Knast, R.: The dot depth hierarchy of star free languages is infinite. J. of Computing Systems Science\u00a016, 37\u201355 (1978)","journal-title":"J. of Computing Systems Science"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Barringer, B.H., Kuiper, R., Pnueli, A.: A really abstract concurrent model and its temporal logic. In: Proceedings of the 13th annual symposium on principles of programing languages, pp. 173\u2013183 (1986)","DOI":"10.1145\/512644.512660"},{"key":"43_CR5","unstructured":"Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Perspectives in mathematical logic. Springer, Heidelberg (1991)"},{"key":"43_CR6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.4064\/fm-49-2-129-141","volume":"49","author":"A. Ehrenfeucht","year":"1961","unstructured":"Ehrenfeucht, A.: An application of games to the completeness problem for formalized theories. Fundamenta Mathematicae\u00a049, 129\u2013141 (1961)","journal-title":"Fundamenta Mathematicae"},{"key":"43_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4064\/fm-47-1-57-103","volume":"47","author":"S. Feferman","year":"1959","unstructured":"Feferman, S., Vaught, R.L.: The first-order properties of products of algebraic systems. Fundamenta Mathematicae\u00a047, 57\u2013103 (1959)","journal-title":"Fundamenta Mathematicae"},{"key":"43_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013976","volume-title":"Temporal Logics","author":"D.M. Gabbay","year":"1994","unstructured":"Gabbay, D.M., Hodkinson, I., Reynolds, M.: Temporal Logics, vol.\u00a01. Clarendon Press, Oxford (1994)"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Gabbay, D.M., Pnueli, A., Shelah, S., Stavi, J.: On the Temporal Analysis of Fairness. In: 7th ACM Symposium on Principles of Programming Languages, Las Vegas, pp. 163\u2013173 (1980)","DOI":"10.1145\/567446.567462"},{"key":"43_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/BFb0055640","volume-title":"CONCUR \u201998 Concurrency Theory","author":"T.A. Henzinger","year":"1998","unstructured":"Henzinger, T.A.: It\u2019s about time: Real-time logics reviewed. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 439\u2013454. Springer, Heidelberg (1998)"},{"key":"43_CR11","first-page":"479","volume-title":"Model-Theoretic Logics","author":"Y. Gurevich","year":"1985","unstructured":"Gurevich, Y.: Monadic second-order theories. In: Barwise, J., Feferman, S. (eds.) Model-Theoretic Logics, pp. 479\u2013506. Springer, Heidelberg (1985)"},{"key":"43_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/3-540-48523-6_39","volume-title":"Automata, Languages and Programming","author":"Y. Hirshfeld","year":"1999","unstructured":"Hirshfeld, Y., Rabinovich, A.: A Framework for Decidable Metrical Logics. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 422\u2013432. Springer, Heidelberg (1999)"},{"key":"43_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-48168-0_13","volume-title":"Computer Science Logic","author":"Y. Hirshfeld","year":"1999","unstructured":"Hirshfeld, Y., Rabinovich, A.: Quantitative Temporal Logic. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 172\u2013187. Springer, Heidelberg (1999)"},{"issue":"1","key":"43_CR14","first-page":"1","volume":"62","author":"Y. Hirshfeld","year":"2004","unstructured":"Hirshfeld, Y., Rabinovich, A.: Logics for Real Time: Decidability and Complexity. Fundam. Inform.\u00a062(1), 1\u201328 (2004)","journal-title":"Fundam. Inform."},{"issue":"2","key":"43_CR15","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"},{"key":"43_CR16","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.\u00a03967, pp. 211\u2013220. Springer, Heidelberg (2006)"},{"key":"43_CR17","unstructured":"Hirshfeld, Y., Rabinovich, A.: On The complexity of the temporal logic with counting modalities. Manuscript (2006)"},{"key":"43_CR18","unstructured":"Kamp, H.: Tense Logic and the Theory of Linear Order. Ph.D. thesis, University of California L.A. (1968)"},{"key":"43_CR19","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/BF01191722","volume":"30","author":"Z. Manna","year":"1993","unstructured":"Manna, Z., Pnueli, A.: Models for reactivity. Acta informatica\u00a030, 609\u2013678 (1993)","journal-title":"Acta informatica"},{"issue":"1-3","key":"43_CR20","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.apal.2003.11.002","volume":"126","author":"J.A. Makowsky","year":"2004","unstructured":"Makowsky, J.A.: Algorithmic aspects of the Feferman-Vaught theorem. Annals of Pure and Applied Logic\u00a0126(1-3), 159\u2013213 (2004)","journal-title":"Annals of Pure and Applied Logic"},{"key":"43_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-45694-5_4","volume-title":"CONCUR 2002 - Concurrency Theory","author":"A. Rabinovich","year":"2002","unstructured":"Rabinovich, A.: Expressive Power of Temporal Logics. In: Brim, L., Jan\u010dar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 57\u201375. Springer, Heidelberg (2002)"},{"key":"43_CR22","doi-asserted-by":"publisher","first-page":"349","DOI":"10.2307\/1971037","volume":"102","author":"S. Shelah","year":"1975","unstructured":"Shelah, S.: The monadic theory of order. Ann. of Math.\u00a0102, 349\u2013419 (1975)","journal-title":"Ann. of Math."},{"key":"43_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/3-540-63246-8_8","volume-title":"Structures in Logic and Computer Science","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In: Mycielski, J., Rozenberg, G., Salomaa, A. (eds.) Structures in Logic and Computer Science. LNCS, vol.\u00a01261, pp. 118\u2013143. Springer, Heidelberg (1997)"},{"key":"43_CR24","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 Time State Sequences in Powerful Decidable Logics and Time Automata. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol.\u00a0863, pp. 694\u2013715. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11821069_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:30:42Z","timestamp":1619508642000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11821069_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377917","9783540377931"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11821069_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}