{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:57:47Z","timestamp":1743029867106,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642116223"},{"type":"electronic","value":"9783642116230"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11623-0_1","type":"book-chapter","created":{"date-parts":[[2010,1,25]],"date-time":"2010-01-25T01:08:29Z","timestamp":1264381709000},"page":"1-33","source":"Crossref","is-referenced-by-count":6,"title":["A Process-Theoretic Look at Automata"],"prefix":"10.1007","author":[{"given":"J. C. M.","family":"Baeten","sequence":"first","affiliation":[]},{"given":"P. J. L.","family":"Cuijpers","sequence":"additional","affiliation":[]},{"given":"B.","family":"Luttik","sequence":"additional","affiliation":[]},{"given":"P. J. A.","family":"van Tilburg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","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 Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2009)"},{"key":"1_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"},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1219092.1219094","volume":"54","author":"J.C.M. Baeten","year":"2007","unstructured":"Baeten, J.C.M., Corradini, F., Grabmayer, C.A.: A characterization of regular expressions under bisimulation. Journal of the ACM\u00a054(2), 1\u201328 (2007)","journal-title":"Journal of the ACM"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-85361-9_11","volume-title":"CONCUR 2008 - Concurrency Theory","author":"J.C.M. Baeten","year":"2008","unstructured":"Baeten, J.C.M., Cuijpers, P.J.L., van Tilburg, P.J.A.: A context-free process as a pushdown automaton. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 98\u2013113. Springer, Heidelberg (2008)"},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(96)00034-8","volume":"58","author":"T. Basten","year":"1996","unstructured":"Basten, T.: Branching bisimilarity is an equivalence indeed!. Information Processing Letters\u00a058(3), 141\u2013147 (1996)","journal-title":"Information Processing Letters"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-45132-3_11","volume-title":"Machines, Computations, and Universality","author":"D. Caucal","year":"2001","unstructured":"Caucal, D.: On the transition graphs of Turing machines. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol.\u00a02055, pp. 177\u2013189. Springer, Heidelberg (2001)"},{"key":"1_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":"R.J. van Glabbeek","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)"},{"key":"1_CR8","first-page":"190","volume":"53","author":"R.J. van Glabbeek","year":"1994","unstructured":"van Glabbeek, R.J.: What is Branching Time Semantics and why to use it?. Bulletin of the EATCS\u00a053, 190\u2013198 (1994)","journal-title":"Bulletin of the EATCS"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/B978-044482830-9\/50019-9","volume-title":"Handbook of Process Algebra","author":"R.J. van Glabbeek","year":"2001","unstructured":"van Glabbeek, R.J.: The Linear Time \u2013 Branching Time Spectrum I. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 3\u201399. Elsevier, Amsterdam (2001)"},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R.J. van Glabbeek","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"},{"key":"1_CR11","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2006","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Pearson, London (2006)"},{"key":"1_CR12","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-61604-7_56","volume-title":"CONCUR \u201996: Concurrency Theory","author":"F. Moller","year":"1996","unstructured":"Moller, F.: Infinite results. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 195\u2013216. Springer, Heidelberg (1996)"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D.E. Muller","year":"1985","unstructured":"Muller, D.E., Schupp, P.E.: The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science\u00a037, 51\u201375 (1985)","journal-title":"Theoretical Computer Science"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jlap.2004.05.001","volume":"60-61","author":"G.D. Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. J. Log. Algebr. Program.\u00a060-61, 17\u2013139 (2004)","journal-title":"J. Log. Algebr. Program."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11623-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T03:15:31Z","timestamp":1676690131000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11623-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642116223","9783642116230"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11623-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}