{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:52:26Z","timestamp":1725565946743},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_28","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T22:53:21Z","timestamp":1284591201000},"page":"307-319","source":"Crossref","is-referenced-by-count":21,"title":["Comparing Recursion, Replication, and Iteration in Process Calculi"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Busi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Gabbrielli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluigi","family":"Zavattaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-45061-0_12","volume-title":"Automata, Languages and Programming","author":"N. Busi","year":"2003","unstructured":"Busi, N., Gabbrielli, M., Zavattaro, G.: Replication vs. Recursive Definitions in Channel Based Calculi. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 133\u2013144. Springer, Heidelberg (2003)"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-Structured Transition Systems Everywhere! Theoretical Computer Science\u00a0256, 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-24727-2_17","volume-title":"Foundations of Software Science and Computation Structures","author":"P. Giambiagi","year":"2004","unstructured":"Giambiagi, P., Schneider, G., Valencia, F.D.: On the Expressiveness of CCS-like Calculi. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 226\u2013240. Springer, Heidelberg (2004)"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc.\u00a02, 236\u2013366 (1952)","journal-title":"Proc. London Math. Soc."},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P.C. Kanellakis","year":"1990","unstructured":"Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. Information and Computation\u00a086(1), 43\u201368 (1990)","journal-title":"Information and Computation"},{"key":"28_CR6","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"28_CR7","volume-title":"Computation: finite and infinite machines","author":"M.L. Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"28_CR8","volume-title":"Proc. of PPDP 2002","author":"M. Nielsen","year":"2002","unstructured":"Nielsen, M., Palamidessi, C., Valencia, F.D.: On the Expressive Power of Temporal Concurrent Constraint Programming Languages. In: Proc. of PPDP 2002, ACM Press, New York (2002)"},{"issue":"6","key":"28_CR9","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal of Computing\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM Journal of Computing"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/321160.321170","volume":"10","author":"J.C. Shepherdson","year":"1963","unstructured":"Shepherdson, J.C., Sturgis, J.E.: Computability of recursive functions. Journal of the ACM\u00a010, 217\u2013255 (1963)","journal-title":"Journal of the ACM"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-45005-X_17","volume-title":"Developments in Language Theory","author":"J. Srba","year":"2003","unstructured":"Srba, J.: Undecidability of Weak Bisimilarity for PA-Processes. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol.\u00a02450, pp. 197\u2013208. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:30:55Z","timestamp":1620012655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}