{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:43:37Z","timestamp":1725536617044},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642044199"},{"type":"electronic","value":"9783642044205"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04420-5_11","type":"book-chapter","created":{"date-parts":[[2009,8,26]],"date-time":"2009-08-26T22:17:25Z","timestamp":1251325045000},"page":"107-119","source":"Crossref","is-referenced-by-count":2,"title":["Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems"],"prefix":"10.1007","author":[{"given":"Pieter","family":"Collins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan S.","family":"Zapreev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","first-page":"698","volume-title":"International Conference on Decision and Control, CDC 1997","author":"S.N. Artemov","year":"1997","unstructured":"Artemov, S.N., Davoren, J.M., Nerode, A.: Logic, Topological Semantics and Hybrid Systems. In: International Conference on Decision and Control, CDC 1997, vol.\u00a01, pp. 698\u2013701. IEEE Press, Los Alamitos (1997)"},{"key":"11_CR2","unstructured":"Balluchi, A., Casagrande, A., Collins, P., Ferrari, A., Villa, T., Sangiovanni-Vincentelli, A.L.: Ariadne: A Framework for Reachability Analysis of Hybrid Automata. In: Symposium on Mathematical Theory of Networks and Systems (MTNS 2006), Kyoto, Japan (July 2006) (to appear)"},{"issue":"1-3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(02)00693-X","volume":"305","author":"V. Brattka","year":"2003","unstructured":"Brattka, V., Presser, G.: Computability on subsets of metric spaces. Theoretical Computer Science\u00a0305(1-3), 43\u201376 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E.M. Clarke","year":"1986","unstructured":"Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. AMC Transactions On Programming Languages And Systems\u00a08(2), 244\u2013263 (1986)","journal-title":"AMC Transactions On Programming Languages And Systems"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/BFb0013029","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School\/Workshop","author":"E.M. Clarke","year":"1989","unstructured":"Clarke, E.M., Draghicescu, I.A.: Expressibility Results for Linear-Time and Branching-Time Logics. In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School\/Workshop, London, UK, pp. 428\u2013437. Springer, Heidelberg (1989)"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.tcs.2005.05.001","volume":"341","author":"P. Collins","year":"2005","unstructured":"Collins, P.: Continuity and computability of reachable sets. Theoretical Computer Science\u00a0341(1), 162\u2013195 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00224-006-1338-3","volume":"41","author":"P. Collins","year":"2007","unstructured":"Collins, P.: Optimal Semicomputable Approximations to Reachable and Invariant Sets. Theory of Computing Systems\u00a041(1), 33\u201348 (2007)","journal-title":"Theory of Computing Systems"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Collins, P.J., Zapreev, I.S.: Computable CTL for Discrete-Time and Continuous-Space Dynamic Systems. Technical Report MAS-E0903, MAS, Centrum Wiskunde & Informatica (2009), http:\/\/www.cwi.nl\/ftp\/CWIreports\/MAS\/MAS-E0903.pdf","DOI":"10.1007\/978-3-642-04420-5_11"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Collins, P.J., Zapreev, I.S.: Computable CTL for Discrete-Time and Continuous-Space Dynamic Systems. In: Computability in Europe, CiE (2009), To be published in a local pre-conference proceedings volume","DOI":"10.1007\/978-3-642-04420-5_11"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E.A. Emerson","year":"1986","unstructured":"Emerson, E.A., Halpern, J.Y.: \u201csometimes\u201d and \u201cNot Never\u201d Revisited: On Branching versus Linear Time Temporal Logic. Journal of the Association for Computing Machinery (ACM)\u00a033(1), 151\u2013178 (1986)","journal-title":"Journal of the Association for Computing Machinery (ACM)"},{"key":"11_CR11","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. Research Report RC 10133 (44981), IBM Research Division, August 1983, p. 42 (1983)"},{"issue":"1\u20133","key":"11_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.apal.2004.06.004","volume":"131","author":"P. Kremer","year":"2005","unstructured":"Kremer, P., Mints, G.: Dynamic topological logic. Annals of Pure and Applied Logic\u00a0131(1\u20133), 133\u2013158 (2005)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/1055686.1055689","volume":"6","author":"O. Kupferman","year":"2005","unstructured":"Kupferman, O., Vardi, M.Y.: From Linear Time to Branching Time. ACM Transactions on Computational Logic (TOCL)\u00a06(2), 273\u2013294 (2005)","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"11_CR14","first-page":"643","volume-title":"Annual Symposium on Foundations of Computer Science, FOCS 2000","author":"M. Maidl","year":"2000","unstructured":"Maidl, M.: The Common Fragment of CTL and LTL. In: Annual Symposium on Foundations of Computer Science, FOCS 2000, pp. 643\u2013652. IEEE Computer Society, Los Alamitos (2000)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-57318-6_35","volume-title":"Hybrid Systems","author":"A. Nerode","year":"1993","unstructured":"Nerode, A., Kohn, W.: Models for Hybrid Systems: Automata, Topologies, Controllability, Observability. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol.\u00a0736, pp. 317\u2013356. Springer, Heidelberg (1993)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0022460","volume-title":"Semantics of Concurrent Computation","author":"A. Pnueli","year":"1979","unstructured":"Pnueli, A.: The Temporal Semantics of Concurrent Programs. In: Kahn, G. (ed.) Semantics of Concurrent Computation. LNCS, vol.\u00a070, pp. 1\u201320. Springer, Heidelberg (1979)"},{"key":"11_CR17","volume-title":"TTCSS","author":"K. Schneider","year":"2004","unstructured":"Schneider, K.: Verification of Reactive Systems: Formal Methods and Algorithms. In: TTCSS. Springer, Heidelberg (2004)"},{"key":"11_CR18","unstructured":"Schnoebelen, P.: The complexity of temporal logic model checking. In: Balbiani, P., Suzuki, N.-Y., Wolter, F., Zakharyaschev, M. (eds.) Selected Papers from the 4th Workshop on Advances in Modal Logics (AiML), Toulouse, France, pp. 393\u2013436. King\u2019s College Publication (2003)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.entcs.2008.12.023","volume":"221","author":"D. Spreen","year":"2008","unstructured":"Spreen, D.: On the Continuity of Effective Multifunctions. Electron. Notes Theor. Comput. Sci.\u00a0221, 271\u2013286 (2008)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"11_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis: An Introduction","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis: An Introduction. Springer, New York (2000)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04420-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T01:59:05Z","timestamp":1558490345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04420-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642044199","9783642044205"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04420-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}