{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:01:07Z","timestamp":1725858067540},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319401881"},{"type":"electronic","value":"9783319401898"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40189-8_32","type":"book-chapter","created":{"date-parts":[[2016,6,13]],"date-time":"2016-06-13T15:34:07Z","timestamp":1465832047000},"page":"312-322","source":"Crossref","is-referenced-by-count":2,"title":["On the Executability of Interactive Computation"],"prefix":"10.1007","author":[{"given":"Bas","family":"Luttik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814105","volume-title":"Reactive Systems-Modelling, Specification and Verification","author":"L Aceto","year":"2007","unstructured":"Aceto, L., Ing\u00f3lfsd\u00f3ttir, A., Larsen, K.G., Srba, J.: Reactive Systems-Modelling, Specification and Verification. Cambridge University Press, Cambridge (2007)"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-11623-0_1","volume-title":"Fundamentals of Software Engineering","author":"JCM Baeten","year":"2010","unstructured":"Baeten, J.C.M., Cuijpers, P.J.L., Luttik, B., van Tilburg, P.J.A.: A process-theoretic look at automata. In: Arbab, F., Sirjani, M. (eds.) FSEN 2009. LNCS, vol. 5961, pp. 1\u201333. Springer, Heidelberg (2010)"},{"key":"32_CR3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.ic.2013.08.010","volume":"231","author":"JCM Baeten","year":"2013","unstructured":"Baeten, J.C.M., Luttik, B., van Tilburg, P.: Reactive Turing machines. Inf. Comput. 231, 143\u2013166 (2013)","journal-title":"Inf. Comput."},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/978-3-642-40728-4_8","volume-title":"Artificial Neural Networks and Machine Learning \u2013 ICANN 2013","author":"J Cabessa","year":"2013","unstructured":"Cabessa, J., Villa, A.E.P.: The super-Turing computational power of interactive evolving recurrent neural networks. In: Mladenov, V., Koprinkova-Hristova, P., Palm, G., Villa, A.E.P., Appollini, B., Kasabov, N. (eds.) ICANN 2013. LNCS, vol. 8131, pp. 58\u201365. Springer, Heidelberg (2013)"},{"issue":"3","key":"32_CR5","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"RJ Glabbeek van","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J. ACM (JACM) 43(3), 555\u2013600 (1996)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"32_CR6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.3233\/FI-2009-109","volume":"93","author":"R Glabbeek van","year":"2009","unstructured":"van Glabbeek, R., Luttik, B., Tr\u010dka, N.: Branching bisimilarity with explicit divergence. Fundam. Informaticae 93(4), 371\u2013392 (2009)","journal-title":"Fundam. Informaticae"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR\u201993","author":"RJ Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: The linear time \u2014 branching time spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 66\u201381. Springer, Heidelberg (1993)"},{"key":"32_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-34874-3","volume-title":"Interactive Computation: The New Paradigm","author":"D Goldin","year":"2006","unstructured":"Goldin, D., Smolka, S.A., Wegner, P.: Interactive Computation: The New Paradigm. Springer, Heidelberg (2006)"},{"key":"32_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/3-540-44612-5_7","volume-title":"Mathematical Foundations of Computer Science 2000","author":"J Leeuwen van","year":"2000","unstructured":"van Leeuwen, J., Wiedermann, J.: On algorithms and interaction. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 99\u2013113. Springer, Heidelberg (2000)"},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-45627-9_8","volume-title":"SOFSEM 2001: Theory and Practice of Informatics","author":"J Leeuwen van","year":"2001","unstructured":"van Leeuwen, J., Wiedermann, J.: Beyond the Turing limit: evolving interactive systems. In: Pacholski, L., Ru\u017ei\u010dka, P. (eds.) SOFSEM 2001. LNCS, vol. 2234, pp. 90\u2013109. Springer, Heidelberg (2001)"},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1139","DOI":"10.1007\/978-3-642-56478-9_30","volume-title":"Mathematics Unlimited-2001 and Beyond","author":"J Leeuwen van","year":"2001","unstructured":"van Leeuwen, J., Wiedermann, J.: The Turing machine paradigm in contemporary computing. In: Enquist, B., Schmidt, W. (eds.) Mathematics Unlimited-2001 and Beyond. LNCS, vol. 2001, pp. 1139\u20131155. Springer, Heidelberg (2001)"},{"key":"32_CR12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-34874-3_6","volume-title":"Interactive Computation","author":"J Leeuwen van","year":"2006","unstructured":"van Leeuwen, J., Wiedermann, J.: A theory of interactive computation. In: Goldin, D., Smolka, S.A., Wegner, P. (eds.) Interactive Computation, pp. 119\u2013142. Springer, Heidelberg (2006)"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Luttik, B., Yang, F.: Executability and the $$\\pi $$ \u03c0 -calculus (extended abstract). In: Proceedings of ICE 2015, pp. 37\u201352 (2015)","DOI":"10.4204\/EPTCS.189.5"},{"key":"32_CR14","unstructured":"Luttik, B., Yang, F.: On the Executability of Interactive Computation. CoRR abs\/1601.01546 (2016). http:\/\/arxiv.org\/abs\/1601.01546"},{"key":"32_CR15","doi-asserted-by":"crossref","first-page":"345","DOI":"10.2307\/2371045","volume":"58","author":"AM Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers, with an application to the Entscheidungs-problem. J. Math. 58, 345\u2013363 (1936)","journal-title":"J. Math."},{"key":"32_CR16","unstructured":"Verbaan, P.R.A.: The computational complexity of evolving systems. Ph.D. thesis, Utrecht University (2006)"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/978-3-540-69407-6_61","volume-title":"Logic and Theory of Algorithms","author":"J Wiedermann","year":"2008","unstructured":"Wiedermann, J., van Leeuwen, J.: How we think of computing today. In: Beckmann, A., Dimitracopoulos, C., L\u00f6we, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 579\u2013593. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Pursuit of the Universal"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40189-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T05:29:26Z","timestamp":1600752566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40189-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319401881","9783319401898"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40189-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}