{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:36:21Z","timestamp":1725600981555},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229527"},{"type":"electronic","value":"9783642229534"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22953-4_30","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T08:28:08Z","timestamp":1313569688000},"page":"348-359","source":"Crossref","is-referenced-by-count":6,"title":["Reactive Turing Machines"],"prefix":"10.1007","author":[{"given":"Jos C. M.","family":"Baeten","sequence":"first","affiliation":[]},{"given":"Bas","family":"Luttik","sequence":"additional","affiliation":[]},{"given":"Paul","family":"van Tilburg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195003","volume-title":"Process Algebra (Equational Theories of Communicating Processes)","author":"J.C.M. Baeten","year":"2009","unstructured":"Baeten, J.C.M., Basten, T., Reniers, M.A.: Process Algebra (Equational Theories of Communicating Processes). Cambridge University Press, Cambridge (2009)"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","volume":"51","author":"J.C.M. Baeten","year":"1987","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: On the consistency of Koomen\u2019s fair abstraction rule. Theoretical Computer Science\u00a051, 129\u2013176 (1987)","journal-title":"Theoretical Computer Science"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-11623-0_1","volume-title":"Fundamentals of Software Engineering","author":"J.C.M. 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.\u00a05961, pp. 1\u201333. Springer, Heidelberg (2010)"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Luttik, B., van Tilburg, P.J.A.: Reactive Turing machines. CoRR, abs\/1104.1738 (2011)","DOI":"10.1007\/978-3-642-22953-4_30"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theoretical Computer Science\u00a037, 77\u2013121 (1985)","journal-title":"Theoretical Computer Science"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Blass, A., Gurevich, Y., Rosenzweig, D., Rossman, B.: Interactive small-step algorithms I: Axiomatization. Logical Methods in Computer Science\u00a03(4) (2007)","DOI":"10.2168\/LMCS-3(4:3)2007"},{"key":"30_CR7","series-title":"NATO-ASI Series","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-82453-1_9","volume-title":"Logics and Models of Concurrent Systems","author":"G. Boudol","year":"1985","unstructured":"Boudol, G.: Notes on algebraic calculi of processes. In: Apt, K.R. (ed.) Logics and Models of Concurrent Systems. NATO-ASI Series, vol.\u00a0F13, pp. 261\u2013303. Springer, Berlin (1985)"},{"issue":"1","key":"30_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0020-0190(89)90168-3","volume":"30","author":"P. Darondeau","year":"1989","unstructured":"Darondeau, P.: Bisimulation and effectiveness. Inf. Process. Lett.\u00a030(1), 19\u201320 (1989)","journal-title":"Inf. Process. Lett."},{"key":"30_CR9","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":"R.J. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: The Linear Time \u2013 Branching Time Spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 66\u201381. Springer, Heidelberg (1993)"},{"issue":"4","key":"30_CR10","doi-asserted-by":"crossref","first-page":"371","DOI":"10.3233\/FI-2009-109","volume":"93","author":"R.J. Glabbeek van","year":"2009","unstructured":"van Glabbeek, R.J., Luttik, B., Trcka, N.: Branching bisimilarity with explicit divergence. Fundam. Inform.\u00a093(4), 371\u2013392 (2009)","journal-title":"Fundam. Inform."},{"issue":"3","key":"30_CR11","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R.J. Glabbeek van","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. Journal of the ACM\u00a043(3), 555\u2013600 (1996)","journal-title":"Journal of the ACM"},{"issue":"2","key":"30_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ic.2004.07.002","volume":"194","author":"D.Q. Goldin","year":"2004","unstructured":"Goldin, D.Q., Smolka, S.A., Attie, P.C., Sonderegger, E.L.: Turing machines, transition systems, and interaction. Inf. Comput.\u00a0194(2), 101\u2013128 (2004)","journal-title":"Inf. Comput."},{"key":"30_CR13","series-title":"NATO ASI Series","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-82453-1_17","volume-title":"Logics and Models of Concurrent Systems","author":"D. Harel","year":"1985","unstructured":"Harel, D., Pnueli, A.: On the development of reactive systems. In: Apt, K.R. (ed.) Logics and Models of Concurrent Systems. NATO ASI Series, vol.\u00a0F-13, pp. 477\u2013498. Springer, New York (1985)"},{"key":"30_CR14","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"30_CR15","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"30_CR16","unstructured":"Petri, C.A.: Kommunikation mit Automaten. PhD thesis, Bonn: Institut f\u00fcr Instrumentelle Mathematik, Schriften des IIM Nr. 2 (1962)"},{"key":"30_CR17","first-page":"260","volume-title":"Proceedings of the First Imperial College Department of Computing Workshop on Theory and Formal Methods, Workshops in Computing","author":"I.C.C. Phillips","year":"1993","unstructured":"Phillips, I.C.C.: A note on expressiveness of process algebra. In: Burn, G.L., Gay, S., Ryan, M.D. (eds.) Proceedings of the First Imperial College Department of Computing Workshop on Theory and Formal Methods, Workshops in Computing, pp. 260\u2013264. Springer, Heidelberg (1993)"},{"key":"30_CR18","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, New York (1967); Reprinted by MIT Press (1987)"},{"issue":"42","key":"30_CR19","first-page":"230","volume":"2","author":"A.M. Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society\u00a02(42), 230\u2013265 (1936)","journal-title":"Proceedings of the London Mathematical Society"},{"issue":"2","key":"30_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1112\/plms\/s2-45.1.161","volume":"45","author":"A.M. Turing","year":"1939","unstructured":"Turing, A.M.: Systems of logic based on ordinals. Proceedings of the London Mathematical Society\u00a045(2), 161\u2013228 (1939)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"30_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a01893, pp. 99\u2013113. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22953-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T06:08:24Z","timestamp":1592806104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22953-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229527","9783642229534"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22953-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}