乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T20:02:23Z","timestamp":1726257743137},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031617157"},{"type":"electronic","value":"9783031617164"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-61716-4_1","type":"book-chapter","created":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T03:47:52Z","timestamp":1716954472000},"page":"1-16","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sequential Value Passing Yields a\u00a0Kleene Theorem for\u00a0Processes"],"prefix":"10.1007","author":[{"given":"Jos C. M.","family":"Baeten","sequence":"first","affiliation":[]},{"given":"Bas","family":"Luttik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Aceto, L., Fokkink, W.J., Verhoef, C.: Structural operational semantics. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 197\u2013292. North-Holland\/Elsevier (2001). https:\/\/doi.org\/10.1016\/b978-044482830-9\/50021-7","DOI":"10.1016\/b978-044482830-9\/50021-7"},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/1219092.1219094","volume":"54","author":"JCM Baeten","year":"2007","unstructured":"Baeten, J.C.M., Corradini, F., Grabmayer, C.A.: A characterization of regular expressions under bisimulation. J. ACM 54(2), 6\u201328 (2007). https:\/\/doi.org\/10.1145\/1219092.1219094","journal-title":"J. ACM"},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/S0304-3975(96)00253-8","volume":"177","author":"JCM Baeten","year":"1997","unstructured":"Baeten, J.C.M., Bergstra, J.A.: Process algebra with propositional signals. Theor. Comput. Sci. 177(2), 381\u2013405 (1997). https:\/\/doi.org\/10.1016\/S0304-3975(96)00253-8","journal-title":"Theor. Comput. Sci."},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Baeten, J.C.M., Carissimo, C., Luttik, B.: Pushdown automata and context-free grammars in bisimulation semantics. Logical Methods Comput. Sci. 19, 15:1\u201315.32 (2023). https:\/\/doi.org\/10.46298\/LMCS-19(1:15)2023","DOI":"10.46298\/LMCS-19(1:15)2023"},{"issue":"6","key":"1_CR5","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1017\/S0960129514000309","volume":"26","author":"JCM Baeten","year":"2016","unstructured":"Baeten, J.C.M., Luttik, B., Muller, T., van Tilburg, P.: Expressiveness modulo bisimilarity of regular expressions with parallel composition. Math. Struct. Comput. Sci. 26(6), 933\u2013968 (2016). https:\/\/doi.org\/10.1017\/S0960129514000309","journal-title":"Math. Struct. Comput. Sci."},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Baeten, J.C.M., Luttik, B., Yang, F.: Sequential composition in the presence of intermediate termination (extended abstract). In: Peters, K., Tini, S. (eds.) Proceedings Combined 24th International Workshop on Expressiveness in Concurrency and 14th Workshop on Structural Operational Semantics and 14th Workshop on Structural Operational Semantics, EXPRESS\/SOS 2017, Berlin, Germany, 4 September 2017. EPTCS, vol.\u00a0255, pp. 1\u201317 (2017). https:\/\/doi.org\/10.4204\/EPTCS.255.1. http:\/\/arxiv.org\/abs\/1709.00049","DOI":"10.4204\/EPTCS.255.1"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Baeten, J.C.M., Verhoef, C.: A congruence theorem for structured operational semantics with predicates. In: Best, E. (ed.) CONCUR \u201993, 4th International Conference on Concurrency Theory, Hildesheim, Germany, 23\u201326 August 1993, Proceedings. Lecture Notes in Computer Science, vol.\u00a0715, pp. 477\u2013492. Springer (1993). https:\/\/doi.org\/10.1007\/3-540-57208-2_33","DOI":"10.1007\/3-540-57208-2_33"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Baeten, J.C., Basten, T., Reniers, M.: Process Algebra: Equational Theories of Communicating Processes, vol.\u00a050. Cambridge university press, Cambridge (2010). https:\/\/doi.org\/10.1017\/CBO9781139195003","DOI":"10.1017\/CBO9781139195003"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Belder, A., Luttik, B., Baeten, J.: Sequencing and intermediate acceptance: axiomatisation and decidability of bisimilarity. In: Roggenbach, M., Sokolova, A. (eds.) 8th Conference on Algebra and Coalgebra in Computer Science, CALCO 2019. Leibniz International Proceedings in Informatics, LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2019.11","DOI":"10.4230\/LIPIcs.CALCO.2019.11"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Bergstra, J.A., Fokkink, W., Ponse, A.: Chapter 5 - process algebra with recursive operations. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 333\u2013389. Elsevier Science, Amsterdam (2001). https:\/\/doi.org\/10.1016\/B978-044482830-9\/50023-0","DOI":"10.1016\/B978-044482830-9\/50023-0"},{"issue":"3","key":"1_CR11","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF01215409","volume":"6","author":"B Bloom","year":"1994","unstructured":"Bloom, B.: When is partial trace equivalence adequate? Formal Aspects Comput. 6(3), 317\u2013338 (1994). https:\/\/doi.org\/10.1007\/BF01215409","journal-title":"Formal Aspects Comput."},{"issue":"5","key":"1_CR12","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1145\/234752.234756","volume":"43","author":"RN Bol","year":"1996","unstructured":"Bol, R.N., Groote, J.F.: The meaning of negative premises in transition system specifications. J. ACM 43(5), 863\u2013914 (1996). https:\/\/doi.org\/10.1145\/234752.234756","journal-title":"J. ACM"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Garavel, H.: Nested-unit petri nets: a structural means to increase efficiency and scalability of verification on elementary nets. In: Devillers, R.R., Valmari, A. (eds.) Application and Theory of Petri Nets and Concurrency - 36th International Conference, PETRI NETS 2015, Brussels, Belgium, 21\u201326 June 2015, Proceedings. Lecture Notes in Computer Science, vol.\u00a09115, pp. 179\u2013199. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-19488-2_9","DOI":"10.1007\/978-3-319-19488-2_9"},{"issue":"3","key":"1_CR14","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"RJ van Glabbeek","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J. ACM 43(3), 555\u2013600 (1996). https:\/\/doi.org\/10.1145\/233551.233556","journal-title":"J. ACM"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.jlap.2004.03.007","volume":"60\u201361","author":"RJ van Glabbeek","year":"2004","unstructured":"van Glabbeek, R.J.: The meaning of negative premises in transition system specifications II. J. Log. Algebr. Program. 60\u201361, 229\u2013258 (2004). https:\/\/doi.org\/10.1016\/j.jlap.2004.03.007","journal-title":"J. Log. Algebr. Program."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Grabmayer, C., Fokkink, W.J.: A complete proof system for 1-free regular expressions modulo bisimilarity. CoRR abs\/2004.12740 (2020). https:\/\/arxiv.org\/abs\/2004.12740","DOI":"10.1145\/3373718.3394744"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(93)90111-6","volume":"118","author":"JF Groote","year":"1993","unstructured":"Groote, J.F.: Transition system specifications with negative premises. Theor. Comput. Sci. 118(2), 263\u2013299 (1993). https:\/\/doi.org\/10.1016\/0304-3975(93)90111-6","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF01221097","volume":"6","author":"JF Groote","year":"1994","unstructured":"Groote, J.F., Ponse, A.: Process algebra with guards: combining hoare logic with process algebra. Formal Aspects Comput. 6(2), 115\u2013164 (1994). https:\/\/doi.org\/10.1007\/BF01221097","journal-title":"Formal Aspects Comput."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BFb0039048","volume-title":"CONCUR \u201990 Theories of Concurrency: Unification and Extension","author":"M Hennessy","year":"1990","unstructured":"Hennessy, M.: Value-passing in process algebras. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 31\u201331. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0039048"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Automata Studies, pp. 3\u201341 (1956)","DOI":"10.1515\/9781400882618-002"},{"issue":"3","key":"1_CR21","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/256167.256195","volume":"19","author":"D Kozen","year":"1997","unstructured":"Kozen, D.: Kleene algebra with tests. ACM Trans. Program. Lang. Syst. 19(3), 427\u2013443 (1997). https:\/\/doi.org\/10.1145\/256167.256195","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Luttik, B.: Divergence-preserving branching bisimilarity. In: Dardha, O., Rot, J. (eds.) Proceedings Combined 27th International Workshop on Expressiveness in Concurrency and 17th Workshop on Structural Operational Semantics, EXPRESS\/SOS 2020, and 17th Workshop on Structural Operational Semantics, Online, 31 August 2020. EPTCS, vol.\u00a0322, pp. 3\u201311 (2020). https:\/\/doi.org\/10.4204\/EPTCS.322.2","DOI":"10.4204\/EPTCS.322.2"},{"issue":"3","key":"1_CR23","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. J. Comput. Syst. Sci. 28(3), 439\u2013466 (1984). https:\/\/doi.org\/10.1016\/0022-0000(84)90023-0","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"1_CR24","first-page":"274","volume":"2","author":"C Verhoef","year":"1995","unstructured":"Verhoef, C.: A congruence theorem for structured operational semantics with predicates and negative premises. Nord. J. Comput. 2(2), 274\u2013302 (1995)","journal-title":"Nord. J. Comput."},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Visser, E., Benaissa, Z.: A core language for rewriting. In: Kirchner, C., Kirchner, H. (eds.) 1998 International Workshop on Rewriting Logic and its Applications, WRLA 1998, Abbaye des Pr\u00e9montr\u00e9s at Pont-\u00e0-Mousson, France, September 1998. Electronic Notes in Theoretical Computer Science, vol.\u00a015, pp. 422\u2013441. Elsevier (1998). https:\/\/doi.org\/10.1016\/S1571-0661(05)80027-1","DOI":"10.1016\/S1571-0661(05)80027-1"}],"container-title":["Lecture Notes in Computer Science","Logics and Type Systems in Theory and Practice"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-61716-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T03:48:02Z","timestamp":1716954482000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-61716-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031617157","9783031617164"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-61716-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}