乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:30:53Z","timestamp":1725701453826},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329395"},{"type":"electronic","value":"9783642329401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32940-1_1","type":"book-chapter","created":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T16:47:02Z","timestamp":1346518022000},"page":"1-20","source":"Crossref","is-referenced-by-count":1,"title":["Turing Meets Milner"],"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":"1_CR1","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Basten, T., Reniers, M.A.: Process Algebra (Equational Theories of Communicating Processes). Cambridge Tracts in Theoretical Computer Science, vol.\u00a050. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195003"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Corradini, F., Grabmayer, C.A.: A characterization of regular expressions under bisimulation. Journal of the ACM\u00a054(2), 6.1\u20136.28 (2007)","DOI":"10.1145\/1219092.1219094"},{"key":"1_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":"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)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Baeten, J., Luttik, B., Muller, T., van Tilburg, P.: Expressiveness modulo bisimilarity of regular expressions with parallel composition (extended abstract). In: Fr\u00f6schle, S., Valencia, F.D. (eds.) Proceedings EXPRESS 2010. EPTCS, vol.\u00a041, pp. 1\u201315 (2010)","DOI":"10.4204\/EPTCS.41.1"},{"key":"1_CR6","unstructured":"Baeten, J.C.M.: Models of Computation: Automata, Formal Languages and Communicating Processes. Technische Universiteit Eindhoven (2011), Syllabus 2IT15"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-19056-8_3","volume-title":"Distributed Computing and Internet Technology","author":"J.C.M. Baeten","year":"2011","unstructured":"Baeten, J.C.M., Luttik, B., van Tilburg, P.: Computations and Interaction. In: Natarajan, R., Ojo, A. (eds.) ICDCIT 2011. LNCS, vol.\u00a06536, pp. 35\u201354. Springer, Heidelberg (2011)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-22953-4_30","volume-title":"Fundamentals of Computation Theory","author":"J.C.M. Baeten","year":"2011","unstructured":"Baeten, J.C.M., Luttik, B., van Tilburg, P.: Reactive Turing Machines. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol.\u00a06914, pp. 348\u2013359. Springer, Heidelberg (2011)"},{"issue":"3","key":"1_CR9","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_CR10","doi-asserted-by":"crossref","unstructured":"Blass, A., Gurevich, Y.: Ordinary interactive small-step algorithms, ii. ACM Trans. Comput. Log.\u00a08(3) (2007)","DOI":"10.1145\/1243996.1243998"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Blass, A., Gurevich, Y.: Ordinary interactive small-step algorithms, iii. ACM Trans. Comput. Log.\u00a08(3) (2007)","DOI":"10.1145\/1243996.1243999"},{"key":"1_CR12","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":"1_CR13","first-page":"190","volume":"53","author":"R.J. Glabbeek van","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"},{"issue":"4","key":"1_CR14","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., Tr\u010dka, N.: Branching bisimilarity with explicit divergence. Fundamenta Informaticae\u00a093(4), 371\u2013392 (2009)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"1_CR15","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"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall (1985)","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Milner, R.: A Calculus of Communicating Systems. LNCS, vol.\u00a092. Springer (1980)","DOI":"10.1007\/3-540-10235-3"},{"issue":"3","key":"1_CR18","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"Milner, R.: A complete inference system for a class of regular behaviours. Journal of Comput. System Sci.\u00a028(3), 439\u2013466 (1984)","journal-title":"Journal of Comput. System Sci."},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/151233.151240","volume":"36","author":"R. Milner","year":"1993","unstructured":"Milner, R.: Elements of interaction. Communications of the ACM\u00a036(1), 78\u201389 (1993)","journal-title":"Communications of the ACM"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 195\u2013216. Springer, Heidelberg (1996)"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D.M.R. Park","year":"1981","unstructured":"Park, D.M.R.: Concurrency and Automata on Infinite Sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jlap.2004.03.009","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."},{"key":"1_CR23","unstructured":"van Tilburg, P.J.A.: From Computability to Executability (A Process-Theoretic View on Automata Theory). PhD thesis, Eindhoven University of Technology (2011)"},{"issue":"2","key":"1_CR24","first-page":"230","volume":"42","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\u00a042(2), 230\u2013265 (1936)","journal-title":"Proceedings of the London Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2012 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32940-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T21:00:02Z","timestamp":1643317202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32940-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329395","9783642329401"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32940-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}