{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:54:25Z","timestamp":1762458865392},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540208136"},{"type":"electronic","value":"9783540398660"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-39866-0_30","type":"book-chapter","created":{"date-parts":[[2010,10,25]],"date-time":"2010-10-25T16:30:09Z","timestamp":1288024209000},"page":"307-318","source":"Crossref","is-referenced-by-count":5,"title":["Causality and Replication in Concurrent Processes"],"prefix":"10.1007","author":[{"given":"Pierpaolo","family":"Degano","sequence":"first","affiliation":[]},{"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[]},{"given":"Corrado","family":"Priami","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s002360050124","volume":"35","author":"M. Boreale","year":"1998","unstructured":"Boreale, M., Sangiorgi, D.: A fully abstract semantics for causality in the \u03c0- calculus. Acta Informatica\u00a035, 353\u2013400 (1998)","journal-title":"Acta Informatica"},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"433","DOI":"10.3233\/FI-1988-11406","volume":"11","author":"G. Boudol","year":"1988","unstructured":"Boudol, G., Castellani, I.: A non-interleaving semantics for CCS based on proved transitions. Fundamenta Informaticae\u00a011, 433\u2013452 (1988)","journal-title":"Fundamenta Informaticae"},{"key":"30_CR3","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":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/BFb0035764","volume-title":"Automata, Languages and Programming","author":"P. Darondeau","year":"1989","unstructured":"Darondeau, P., Degano, P.: Causal trees. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol.\u00a0372, pp. 234\u2013248. Springer, Heidelberg (1989)"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/BFb0028836","volume-title":"Fundamentals of Computation Theory","author":"P. Degano","year":"1985","unstructured":"Degano, P., De Nicola, R., Montanari, U.: Partial ordering derivations for CCS. In: Budach, L. (ed.) FCT 1985. LNCS, vol.\u00a0199, pp. 520\u2013533. Springer, Heidelberg (1985)"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0304-3975(01)00165-7","volume":"275","author":"P. Degano","year":"2002","unstructured":"Degano, P., Gadducci, F., Priami, C.: A concurrent semantics for CCS via rewriting logic. Theoret. Comput. Sci.\u00a0275, 259\u2013282 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/3-540-55719-9_110","volume-title":"Automata, Languages and Programming","author":"P. Degano","year":"1992","unstructured":"Degano, P., Priami, C.: Proved trees. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 629\u2013640. Springer, Heidelberg (1992)"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(99)80003-6","volume":"216","author":"P. Degano","year":"1999","unstructured":"Degano, P., Priami, C.: Non interleaving semantics for mobile processes. Theoret. Comput. Sci.\u00a0216, 237\u2013270 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/384192.384194","volume":"33","author":"P. Degano","year":"2001","unstructured":"Degano, P., Priami, C.: Enhanced operational semantics: A tool for describing and analysing concurrent systems. ACM Computing Surveys\u00a033, 135\u2013176 (2001)","journal-title":"ACM Computing Surveys"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0304-3975(95)00118-2","volume":"153","author":"J. Engelfriet","year":"1996","unstructured":"Engelfriet, J.: A multiset semantics for the pi-calculus with replication. Theoret. Comput. Sci.\u00a0153, 65\u201394 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/BF01178730","volume":"31","author":"A. Kiehn","year":"1994","unstructured":"Kiehn, A.: Comparing causality and locality based equivalences. Acta Informatica\u00a031, 697\u2013718 (1994)","journal-title":"Acta Informatica"},{"key":"30_CR12","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"30_CR13","series-title":"Nato ASI Series F","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-3-642-58041-3_6","volume-title":"Logic and Algebra of Specification","author":"R. Milner","year":"1993","unstructured":"Milner, R.: The polyadic \u03c0-calculus: A tutorial. In: Bauer, F.L., Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification. Nato ASI Series F, vol.\u00a094, pp. 203\u2013246. Springer, Heidelberg (1993)"},{"key":"30_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Part I and II. Information and Computation\u00a0100, 1\u201377 (1992)","journal-title":"Part I and II. Information and Computation"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0304-3975(95)00020-8","volume":"155","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: Locality and interleaving semantics in calculi for mobile processes. Theoret. Comput. Sci.\u00a0155, 39\u201383 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR16","volume-title":"The \u03c0-calculus: A Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39866-0_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T16:34:26Z","timestamp":1636734866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39866-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208136","9783540398660"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39866-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}