{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T05:45:36Z","timestamp":1749793536695},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304951"},{"type":"electronic","value":"9783540324195"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590156_35","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:43:16Z","timestamp":1133797396000},"page":"432-443","source":"Crossref","is-referenced-by-count":34,"title":["On the Expressiveness of TPTL and MTL"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Fabrice","family":"Chevalier","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Markey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Alur, R.: Techniques for Automatic Verification of Real-Time Systems. Ph.D thesis, Stanford Univ., Stanford, CA, USA (1991)"},{"issue":"1","key":"35_CR2","first-page":"2","volume":"104","author":"R. Alur","year":"1993","unstructured":"Alur, R., Courcoubetis, C., Dill, D.: Model-checking in dense real-time. Information. and Computation\u00a0104(1), 2\u201334 (1993)","journal-title":"and Computation"},{"issue":"1","key":"35_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. Journal of the ACM\u00a043(1), 116\u2013146 (1996)","journal-title":"Journal of the ACM"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1109\/LICS.1990.113764","volume-title":"Proc. 5th Ann. Symp. Logic in Computer Science (LICS 1990)","author":"R. Alur","year":"1990","unstructured":"Alur, R., Henzinger, T.A.: Real-time logics: Complexity and expressiveness. In: Proc. 5th Ann. Symp. Logic in Computer Science (LICS 1990), pp. 390\u2013401. IEEE Comp. Soc. Press, Los Alamitos (1990)"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1109\/SFCS.1992.267774","volume-title":"Proc. 33rd Ann. Symp. Foundations of Computer Science (FOCS 1992)","author":"R. Alur","year":"1992","unstructured":"Alur, R., Henzinger, T.A.: Back to the future: towards a theory of timed regular languages. In: Proc. 33rd Ann. Symp. Foundations of Computer Science (FOCS 1992), pp. 177\u2013186. IEEE Comp. Soc. Press, Los Alamitos (1992)"},{"key":"35_CR6","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 Real- Time: Theory in Practice. 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)"},{"issue":"1","key":"35_CR7","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":"1","key":"35_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/174644.174651","volume":"41","author":"R. Alur","year":"1994","unstructured":"Alur, R., Henzinger, T.A.: A really temporal logic. Journal of the ACM\u00a041(1), 181\u2013204 (1994)","journal-title":"Journal of the ACM"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Chevalier, F., Markey, N.: About the expressiveness of TPTL and MTL. Research Report LSV-05-05, LSV, ENS Cachan, France (2005)","DOI":"10.1007\/11590156_35"},{"key":"35_CR10","unstructured":"D\u2019Souza, D., Prabhakar, P.: On the expressiveness of MTL in the pointwise and continuous semantics. Technical Report IISc-CSA-TR-2005-7, Indian Institute of Science, Bangalore, India (2005)"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/567446.567462","volume-title":"Conf. Record 7th ACM Symp. Principles of Programming Languages (POPL 1980)","author":"D.M. Gabbay","year":"1980","unstructured":"Gabbay, D.M., Pnueli, A., Shelah, S., Stavi, J.: On the temporal analysis of fairness. In: Conf. Record 7th ACM Symp. Principles of Programming Languages (POPL 1980), pp. 163\u2013173. ACM Press, New York (1980)"},{"key":"35_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/BFb0055640","volume-title":"CONCUR 1998 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)"},{"issue":"2","key":"35_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/inco.1994.1045","volume":"111","author":"T.A. Henzinger","year":"1994","unstructured":"Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model-checking for real-time systems. Information and Computation\u00a0111(2), 193\u2013244 (1994)","journal-title":"Information and Computation"},{"key":"35_CR14","unstructured":"Kamp, J.A.: Tense Logic and the Theory of Linear Order. Ph.D thesis, UCLA, Los Angeles, CA, USA (1968)"},{"issue":"4","key":"35_CR15","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 Systems\u00a02(4), 255\u2013299 (1990)","journal-title":"Real-Time Systems"},{"key":"35_CR16","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.\u00a03441, pp. 250\u2013265. Springer, Heidelberg (2005)"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Markey, N., Raskin, J.-F.: Model checking restricted sets of timed paths. Theoretical Computer Science (2005) (to appear)","DOI":"10.1007\/978-3-540-28644-8_28"},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/LICS.2005.33","volume-title":"Proc. 19th Ann. Symp. Logic in Computer Science (LICS 2005)","author":"J. Ouaknine","year":"2005","unstructured":"Ouaknine, J., Worrell, J.B.: On the decidability of metric temporal logic. In: Proc. 19th Ann. Symp. Logic in Computer Science (LICS 2005), pp. 188\u2013197. IEEE Comp. Soc. Press, Los Alamitos (2005)"},{"key":"35_CR19","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/SFCS.1977.32","volume-title":"Proc. 18th Ann. Symp. Foundations of Computer Science (FOCS 1977)","author":"A. Pnueli","year":"1977","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proc. 18th Ann. Symp. Foundations of Computer Science (FOCS 1977), pp. 46\u201357. IEEE Comp. Soc. Press, Los Alamitos (1977)"},{"key":"35_CR20","unstructured":"Raskin, J.-F.: Logics, Automata and Classical Theories for Deciding Real-Time. Ph.D thesis, Univ. Namur, Namur, Belgium (1999)"},{"issue":"3","key":"35_CR21","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"P. Sistla","year":"1985","unstructured":"Sistla, P., Clarke, E.M.: The complexity of propositional linear temporal logics. Journal of the ACM\u00a032(3), 733\u2013749 (1985)","journal-title":"Journal of the ACM"},{"key":"35_CR22","series-title":"ENTCS","first-page":"145","volume-title":"Proc. 4th International Workshop on Runtime Verification (RV 2004)","author":"P. Thati","year":"2005","unstructured":"Thati, P., Rosu, G.: Monitoring algorithms for metric temporal logic specifications. In: Proc. 4th International Workshop on Runtime Verification (RV 2004). ENTCS, vol.\u00a0113, pp. 145\u2013162. Elsevier, Amsterdam (2005)"},{"key":"35_CR23","first-page":"322","volume-title":"Proc. 1st Ann. Symp. Logic in Computer Science (LICS 1986)","author":"M.Y. Vardi","year":"1986","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. 1st Ann. Symp. Logic in Computer Science (LICS 1986), pp. 322\u2013344. IEEE Comp. Soc. Press, Los Alamitos (1986)"},{"key":"35_CR24","unstructured":"Yovine, S.: M\u00e9thodes et outils pour la v\u00e9rification symbolique de syst\u00e8mes temporis \u00e9s. Ph.D thesis, INPG, Grenoble, France (1993)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590156_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:49:14Z","timestamp":1619506154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590156_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304951","9783540324195"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11590156_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}