{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:24:39Z","timestamp":1776317079930,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540229407","type":"print"},{"value":"9783540286448","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28644-8_19","type":"book-chapter","created":{"date-parts":[[2010,2,25]],"date-time":"2010-02-25T19:48:13Z","timestamp":1267127293000},"page":"292-307","source":"Crossref","is-referenced-by-count":141,"title":["Reversible Communicating Systems"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Danos","sequence":"first","affiliation":[]},{"given":"Jean","family":"Krivine","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"International Series on Computer Science","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. In: International Series on Computer Science. Prentice Hall, Englewood Cliffs (1989)"},{"key":"19_CR2","unstructured":"L\u00e9vy, J.-J.: R\u00e9ductions optimales en \u03bb-calcul. PhD (1978)"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1145\/322108.322122","volume":"26","author":"G. Berry","year":"1979","unstructured":"Berry, G., L\u00e9vy, J.-J.: Minimal and optimal computation of recursive programs. JACM\u00a026, 148\u2013175 (1979)","journal-title":"JACM"},{"key":"19_CR4","first-page":"459","volume-title":"Pacific Symposium on Biocomputing","author":"A. Regev","year":"2001","unstructured":"Regev, A., Silverman, W., Shapiro, E.: Representation and simulation of biochemical processes using the \u03c0-calculus process algebra. In: Altman, R.B., Dunker, A.K., Hunter, L., Klein, T.E. (eds.) Pacific Symposium on Biocomputing, vol.\u00a06, pp. 459\u2013470. World Scientific Press, Singapore (2001)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Priami, C., Regev, A., Shapiro, E., Silverman, W.: Application of a stochastic name-passing calculus to representation and simulation of molecular processes. Information Processing Letters (2001)","DOI":"10.1016\/S0020-0190(01)00214-9"},{"key":"19_CR6","volume-title":"Proceedings of BIO-CONCUR\u201903","author":"V. Danos","year":"2003","unstructured":"Danos, V., Krivine, J.: Formal molecular biology done in CCS. In: Proceedings of BIO-CONCUR\u201903. Electronic Notes in Theoretical Computer Science, Marseille, France. Elsevier, Amsterdam (2003)"},{"key":"19_CR7","unstructured":"Prasad, K.V.S.: Combinators and bisimulation proofs for restartable systems. PhD (1987)"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Bergstra, J.A., Ponse, A., van Wamel, J.: Process algebra with backtracking. In: REX School Symposium, pp. 46\u201391 (1993)","DOI":"10.1007\/3-540-58043-3_17"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/BFb0013028","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"G. Boudol","year":"1989","unstructured":"Boudol, G., Castellani, I.: Permutation of transitions: An event structure semantics for CCS and SCCS. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol.\u00a0354, pp. 411\u2013427. Springer, Heidelberg (1989)"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(90)90095-Y","volume":"75","author":"P. Degano","year":"1990","unstructured":"Degano, P., Nicola, R.D., Montanari, U.: A partial ordering semantics for CCS. Theoretical Computer Science\u00a075, 223\u2013262 (1990)","journal-title":"Theoretical Computer Science"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Boudol, G., Castellani, I., Hennesy, M., Kiehn, A.: Observing localities. In: MFCS 1991, vol.\u00a0114, pp. 31\u201361 (1991)","DOI":"10.1007\/3-540-54345-7_52"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"19_CR13","unstructured":"Boudol, G., Castellani, I., Hennesy, M., Kiehn, A.: A theory of processes with localities. Formal Aspect of Computing (1992)"},{"issue":"4","key":"19_CR14","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1142\/S0129054195000196","volume":"6","author":"I. Castellani","year":"1995","unstructured":"Castellani, I.: Observing distribution in processes: Static and dynamic localities. International Journal of Foundations of Computer Science\u00a06(4), 353\u2013393 (1995)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1007\/3-540-60084-1_113","volume-title":"Automata, Languages and Programming","author":"P. Degano","year":"1995","unstructured":"Degano, P., Priami, C.: Non interleaving semantics for mobile processes. In: F\u00fcl\u00f6p, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol.\u00a0944, pp. 660\u2013667. Springer, Heidelberg (1995)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Boreale, M., Sangiorgi, D.: A fully abstract semantics for causality in the \u03c0-calculus. Acta Informatica\u00a035 (1998)","DOI":"10.1007\/s002360050124"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BFb0012800","volume-title":"Automata, Languages, and Programming","author":"G. Winskel","year":"1982","unstructured":"Winskel, G.: Event structure semantics for CCS and related languages. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol.\u00a0140, pp. 561\u2013576. Springer, Heidelberg (1982)"},{"key":"19_CR18","unstructured":"Marek, A.: Bednarczyk. Hereditary history preserving bisimulations or what is the power of the future perfect in program logics. ICS PAS Report (April 1991)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2004 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28644-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T11:53:31Z","timestamp":1558871611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28644-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229407","9783540286448"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28644-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}