{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:20:28Z","timestamp":1725524428342},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360381"},{"type":"electronic","value":"9783642360398"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36039-8_6","type":"book-chapter","created":{"date-parts":[[2012,12,21]],"date-time":"2012-12-21T08:54:23Z","timestamp":1356080063000},"page":"50-68","source":"Crossref","is-referenced-by-count":3,"title":["Indiscrete Models: Model Building and Model Checking over Linear Time"],"prefix":"10.1007","author":[{"given":"Tim","family":"French","sequence":"first","affiliation":[]},{"given":"John","family":"McCabe-Dansted","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Reynolds","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"6_CR1","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"},{"issue":"2","key":"6_CR2","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"},{"key":"6_CR3","unstructured":"French, T., McCabe-Dansted, J., Reynolds, M.: Synthesis for temporal logic over the reals. In: AiML 2012, pp. 217\u2013238 (2012)"},{"key":"6_CR4","unstructured":"French, T., McCabe-Dansted, J., Reynolds, M.: Synthesis for general linear time (submitted, 2012)"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1093\/logcom\/1.2.229","volume":"1","author":"D.M. Gabbay","year":"1990","unstructured":"Gabbay, D.M., Hodkinson, I.M.: An axiomatisation of the temporal logic with until and since over the real numbers. Journal of Logic and Computation\u00a01(2), 229\u2013260 (1990)","journal-title":"Journal of Logic and Computation"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Gabbay, D.M., Hodkinson, I.M., Reynolds, M.: Temporal Logic: Mathematical Foundations and Computational Aspects, vol.\u00a01. Oxford University Press (1994)","DOI":"10.1093\/oso\/9780198537694.003.0001"},{"key":"6_CR7","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":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-61604-7_73","volume-title":"CONCUR \u201996: Concurrency Theory","author":"T.A. Henzinger","year":"1996","unstructured":"Henzinger, T.A., Kupferman, O., Vardi, M.Y.: A Space-Efficient on-the-Fly Algorithm for Real-time Model Checking. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 514\u2013529. Springer, Heidelberg (1996)"},{"key":"6_CR9","unstructured":"Kamp, H.: Tense logic and the theory of linear order. PhD thesis, University of California, Los Angeles (1968)"},{"key":"6_CR10","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"},{"key":"6_CR11","unstructured":"N\u00e9meti, I.: Decidable versions of first order logic and cylindric-relativized set algebras. In: Csirmaz, L., Gabbay, D., de Rijke, M. (eds.) Logic Colloquium 1992, pp. 171\u2013241. CSLI Publications (1995)"},{"key":"6_CR12","first-page":"46","volume-title":"Proceedings of the Eighteenth Symposium on Foundations of Computer Science","author":"A. Pnueli","year":"1977","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proceedings of the Eighteenth Symposium on Foundations of Computer Science, pp. 46\u201357. Providence, RI (1977)"},{"key":"6_CR13","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":"6_CR14","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"},{"key":"6_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/3-540-45656-2_36","volume-title":"AI 2001: Advances in Artificial Intelligence","author":"M. Reynolds","year":"2001","unstructured":"Reynolds, M.: Continuous Temporal Models. In: Stumptner, M., Corbett, D., Brooks, M.J. (eds.) AI 2001. LNCS (LNAI), vol.\u00a02256, pp. 414\u2013425. Springer, Heidelberg (2001)"},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0022-0000(03)00005-9","volume":"66","author":"M. Reynolds","year":"2003","unstructured":"Reynolds, M.: The complexity of the temporal logic with \u201duntil\u201d over general linear time. J. Comput. Syst. Sci.\u00a066(2), 393\u2013426 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TIME.2009.16","volume-title":"TIME 2009: Proceedings of the 2009 16th International Symposium on Temporal Representation and Reasoning","author":"M. Reynolds","year":"2009","unstructured":"Reynolds, M.: Dense time reasoning via mosaics. In: TIME 2009: Proceedings of the 2009 16th International Symposium on Temporal Representation and Reasoning, pp. 3\u201310. IEEE Computer Society, Washington, DC (2009)"},{"issue":"8","key":"6_CR18","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), doi:10.1016\/j.apal.2010.01.002","journal-title":"Annals of Pure and Applied Logic"},{"key":"6_CR19","first-page":"19","volume":"3","author":"M. Reynolds","year":"2010","unstructured":"Reynolds, M.: The complexity of temporal logics over linear time. Journal of Studies in Logic\u00a03, 19\u201350 (2010)","journal-title":"Journal of Studies in Logic"},{"key":"6_CR20","volume-title":"Linear Orderings","author":"J.G. Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear Orderings. Academic Press, New York (1982)"},{"key":"6_CR21","unstructured":"Stockmeyer, L.: The complexity of decision problems in automata and logic. PhD thesis, M.I.T (1974)"},{"key":"6_CR22","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1051\/ita\/1986200403711","volume":"20","author":"W. Thomas","year":"1986","unstructured":"Thomas, W.: On frontiers of regular trees. RAIRO Theoretical Informatics and Applications\u00a020, 371\u2013381 (1986)","journal-title":"RAIRO Theoretical Informatics and Applications"}],"container-title":["Lecture Notes in Computer Science","Logic and Its Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36039-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T21:58:09Z","timestamp":1714773489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36039-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360381","9783642360398"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36039-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}