{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:15:35Z","timestamp":1762460135200,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031380990"},{"type":"electronic","value":"9783031381003"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38100-3_2","type":"book-chapter","created":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T22:01:31Z","timestamp":1689112891000},"page":"15-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Replications in\u00a0Reversible Concurrent Calculi"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6346-3043","authenticated-orcid":false,"given":"Cl\u00e9ment","family":"Aubert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Aubert, C.: Concurrencies in reversible concurrent calculi. In: Mezzina, C.A., Podlaski, K. (eds.) RC 2022. LNCS, vol. 13354, pp. 146\u2013163. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-09005-9_10","DOI":"10.1007\/978-3-031-09005-9_10"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Aubert, C.: The correctness of concurrencies in (Reversible) concurrent calculi (Jan 2023). https:\/\/hal.science\/hal-03950347, under revision for JLAMP","DOI":"10.1007\/978-3-031-09005-9_10"},{"key":"2_CR3","unstructured":"Aubert, C., Browning, P.: Implementation of reversible distributed calculus. In: Kutrib, M., Meyer, U. (eds.) RC 2023. LNCS, Springer (2023). https:\/\/hal.science\/hal-04035458v1, to appear"},{"key":"2_CR4","unstructured":"Aubert, C., Browning, P.: IRDC-CCSK (5 2023). https:\/\/github.com\/CinRC\/IRDC-CCSK"},{"key":"2_CR5","unstructured":"Aubert, C., Cristescu, I.: Structural equivalences for reversible calculi of communicating systems (2020). https:\/\/hal.science\/hal-02571597, research report"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Aubert, C., Medi\u0107, D.: Enabling replications and contexts in reversible concurrent calculus (May 2021). https:\/\/hal.science\/hal-03183053, research report","DOI":"10.1007\/978-3-030-79837-6_9"},{"issue":"6","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1017\/S096012950999017X","volume":"19","author":"N Busi","year":"2009","unstructured":"Busi, N., Gabbrielli, M., Zavattaro, G.: On the expressive power of recursion, replication and iteration in process calculi. MSCS 19(6), 1191\u20131222 (2009). https:\/\/doi.org\/10.1017\/S096012950999017X","journal-title":"MSCS"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-28644-8_19","volume-title":"CONCUR 2004 - Concurrency Theory","author":"V Danos","year":"2004","unstructured":"Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292\u2013307. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_19"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-39866-0_30","volume-title":"Perspectives of System Informatics","author":"P Degano","year":"2004","unstructured":"Degano, P., Gadducci, F., Priami, C.: Causality and replication in concurrent processes. In: Broy, M., Zamulin, A.V. (eds.) PSI 2003. LNCS, vol. 2890, pp. 307\u2013318. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-39866-0_30"},{"key":"2_CR10","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. 623, pp. 629\u2013640. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55719-9_110"},{"issue":"1\u20132","key":"2_CR11","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. Theor. Comput. Sci. 216(1\u20132), 237\u2013270 (1999). https:\/\/doi.org\/10.1016\/S0304-3975(99)80003-6","journal-title":"Theor. Comput. Sci."},{"key":"2_CR12","unstructured":"Ghyselen, A.: Sized types methods and their applications to complexity analysis in Pi-calculus. Ph.D. thesis, University of Lyon (2021). https:\/\/tel.archives-ouvertes.fr\/tel-03405961"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-030-79837-6_8","volume-title":"Reversible Computation","author":"I Lanese","year":"2021","unstructured":"Lanese, I., Phillips, I.: Forward-reverse observational equivalences in CCSK. In: Yamashita, S., Yokoyama, T. (eds.) RC 2021. LNCS, vol. 12805, pp. 126\u2013143. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79837-6_8"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-030-45231-5_23","volume-title":"Foundations of Software Science and Computation Structures","author":"I Lanese","year":"2020","unstructured":"Lanese, I., Phillips, I., Ulidowski, I.: An axiomatic approach to reversible computation. In: FoSSaCS 2020. LNCS, vol. 12077, pp. 442\u2013461. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45231-5_23"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0032030","volume-title":"Automata, Languages and Programming","author":"R Milner","year":"1990","unstructured":"Milner, R.: Functions as processes. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 167\u2013180. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032030"},{"key":"2_CR16","unstructured":"Palamidessi, C., Valencia, F.D.: Recursion vs replication in process calculi: expressiveness. Bull. EATCS 87, 105\u2013125 (2005). http:\/\/eatcs.org\/images\/bulletin\/beatcs87.pdf"},{"issue":"1\u20132","key":"2_CR17","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jlap.2006.11.002","volume":"73","author":"I Phillips","year":"2007","unstructured":"Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebr. Program. 73(1\u20132), 70\u201396 (2007). https:\/\/doi.org\/10.1016\/j.jlap.2006.11.002","journal-title":"J. Log. Algebr. Program."},{"key":"2_CR18","unstructured":"Sangiorgi, D., Walker, D.: The Pi-calculus. CUP (2001)"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38100-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T22:01:37Z","timestamp":1689112897000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38100-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031380990","9783031381003"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38100-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"12 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reversible Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Giessen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/reversible-computation-2023.github.io\/site\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}