{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:19:29Z","timestamp":1725761969035},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452208"},{"type":"electronic","value":"9783642452215"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45221-5_22","type":"book-chapter","created":{"date-parts":[[2013,12,5]],"date-time":"2013-12-05T09:28:23Z","timestamp":1386235703000},"page":"309-323","source":"Crossref","is-referenced-by-count":2,"title":["Verifying Temporal Properties in Real Models"],"prefix":"10.1007","author":[{"given":"Tim","family":"French","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"McCabe-Dansted","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Reynolds","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","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.: A theory of timed automata. TCS\u00a0126, 183\u2013235 (1994)","journal-title":"TCS"},{"key":"22_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: de Bakker, J.W., Huizing, C., de Roever, W.P., Rozenberg, G. (eds.) REX 1991. LNCS, vol.\u00a0600, pp. 74\u2013106. Springer, Heidelberg (1992)"},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1305\/ndjfl\/1093870820","volume":"26","author":"J.P. Burgess","year":"1985","unstructured":"Burgess, J.P., Gurevich, Y.: The decision problem for linear temporal logic. Notre Dame J. Formal Logic\u00a026(2), 115\u2013128 (1985)","journal-title":"Notre Dame J. Formal Logic"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-70583-3_11","volume-title":"Automata, Languages and Programming","author":"P. Bouyer","year":"2008","unstructured":"Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.B.: On expressiveness and complexity in real-time model checking. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 124\u2013135. Springer, Heidelberg (2008)"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1305\/ndjfl\/1093870149","volume":"23","author":"J.P. Burgess","year":"1982","unstructured":"Burgess, J.P.: Axioms for tense logic I: \u201cSince\u201d and \u201cUntil\u201d. Notre Dame J. Formal Logic\u00a023(2), 367\u2013374 (1982)","journal-title":"Notre Dame J. Formal Logic"},{"doi-asserted-by":"crossref","unstructured":"Davoren, J., Nerode, A.: Logics for hybrid systems. Proc. IEEE (2000)","key":"22_CR6","DOI":"10.1109\/5.871305"},{"unstructured":"French, T., McCabe-Dansted, J., Reynolds, M.: Synthesis for temporal logic over the reals. In: AiML, 2012, pp. 217\u2013238. College Pub. (2012)","key":"22_CR7"},{"doi-asserted-by":"crossref","unstructured":"French, T., McCabe-Dansted, J., Reynolds, M.: Verifying temporal properties in real models (long report version) (2013), http:\/\/www.csse.uwa.edu.au\/~mark\/research\/Online\/vtprm.html","key":"22_CR8","DOI":"10.1007\/978-3-642-45221-5_22"},{"unstructured":"French, T., McCabe-Dansted, J., Reynolds, M.: Synthesis for continuous time: long draft online. Journal Version Submitted, http:\/\/www.csse.uwa.edu.au\/~mark\/research\/Online\/sctm.htm","key":"22_CR9"},{"doi-asserted-by":"crossref","unstructured":"French, T., McCabe-Dansted, J., Reynolds, M.: Complexity of Model Checking over General Linear Time. In: TIME 2013, pp. 107\u2013116. IEEE CPS (2013)","key":"22_CR10","DOI":"10.1109\/TIME.2013.21"},{"doi-asserted-by":"crossref","unstructured":"French, T., McCabe-Dansted, J., Reynolds, M.: Model Checking General Linear Temporal Logic. In: Galmiche, D., Larchey-Wendling, D. (eds.) TABLEAUX 2013. LNCS, vol.\u00a08123, pp. 119\u2013133. Springer, Heidelberg (2013)","key":"22_CR11","DOI":"10.1007\/978-3-642-40537-2_12"},{"issue":"2","key":"22_CR12","first-page":"229","volume":"1","author":"D. Gabbay","year":"1990","unstructured":"Gabbay, D., Hodkinson, I.: An axiomatisation of the temporal logic with until and since over the real numbers. JLC\u00a01(2), 229\u2013260 (1990)","journal-title":"JLC"},{"doi-asserted-by":"crossref","unstructured":"Gabbay, D.M., Hodkinson, I.M., Reynolds, M.A.: Temporal expressive completeness in the presence of gaps. In: Oikkonen, et al. (eds.) Logic Colloquium 1990. LNL, vol.\u00a02, pp. 89\u2013121. Springer (1993)","key":"22_CR13","DOI":"10.1017\/9781316718254.009"},{"doi-asserted-by":"crossref","unstructured":"Gabbay, D., Hodkinson, I., Reynolds, M.: Temporal Logic: Mathematical Foundations and Computational Aspects. OUP (1994)","key":"22_CR14","DOI":"10.1093\/oso\/9780198537694.001.0001"},{"unstructured":"Hodkinson, I., Reynolds, M.: Separation: past, present &future. In: We Will Show Them: Essays in Honour of D. Gabbay, pp. 117\u2013142. Coll. Publ. (2005)","key":"22_CR15"},{"unstructured":"Kamp, H.: Tense logic and the theory of linear order. PhD thesis, University of California, Los Angeles (1968)","key":"22_CR16"},{"issue":"4","key":"22_CR17","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1023\/A:1008223921944","volume":"6","author":"N. Kurtonina","year":"1997","unstructured":"Kurtonina, N., de Rijke, M.: Bisimulations for temporal logic. Journal of Logic, Language and Information\u00a06(4), 403\u2013425 (1997)","journal-title":"Journal of Logic, Language and Information"},{"key":"22_CR18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.4064\/fm-59-1-109-116","volume":"59","author":"H. L\u00e4uchli","year":"1966","unstructured":"L\u00e4uchli, H., Leonard, J.: On the elementary theory of linear order. Fundamenta Mathematicae\u00a059, 109\u2013116 (1966)","journal-title":"Fundamenta Mathematicae"},{"unstructured":"Christopher McCabe-Dansted, J.: Model Checker Online (2012), http:\/\/www.csse.uwa.edu.au\/~mark\/research\/Online\/mechecker.html","key":"22_CR19"},{"key":"22_CR20","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second order theories and automata on infinite trees. American Mathematical Society Transactions\u00a0141, 1\u201335 (1969)","journal-title":"American Mathematical Society Transactions"},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF00370112","volume":"51","author":"M. Reynolds","year":"1992","unstructured":"Reynolds, M.: An axiomatization for Until and Since over the reals without the IRR rule. Studia Logica\u00a051, 165\u2013193 (1992)","journal-title":"Studia Logica"},{"issue":"8","key":"22_CR22","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1016\/j.apal.2010.01.002","volume":"161","author":"M. Reynolds","year":"2010","unstructured":"Reynolds, M.: The complexity of the temporal logic over the reals. Annals of Pure and Applied Logic\u00a0161(8), 1063\u20131096 (2010)","journal-title":"Annals of Pure and Applied Logic"},{"key":"22_CR23","first-page":"19","volume":"3","author":"M. Reynolds","year":"2010","unstructured":"Reynolds, M.: The complexity of decision problems for linear temporal logics. Journal of Studies in Logic\u00a03, 19\u201350 (2010)","journal-title":"Journal of Studies in Logic"},{"unstructured":"Rosenstein, J.G.: Linear Orderings. Academic Press, New York (1982)","key":"22_CR24"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45221-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T23:26:49Z","timestamp":1716247609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45221-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452208","9783642452215"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45221-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}