{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:13:16Z","timestamp":1762459996526,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030798369"},{"type":"electronic","value":"9783030798376"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79837-6_9","type":"book-chapter","created":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T11:03:03Z","timestamp":1624359783000},"page":"144-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Explicit Identifiers and Contexts in Reversible Concurrent Calculus"],"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7163-5375","authenticated-orcid":false,"given":"Doriana","family":"Medi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,23]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Abadi, M., Blanchet, B., Fournet, C.: The applied Pi calculus: mobile values, new names, and secure communication. J. ACM 65(1), 1:1\u20131:41 (2018). https:\/\/doi.org\/10.1145\/3127586","DOI":"10.1145\/3127586"},{"key":"9_CR2","unstructured":"Amadio, R.M.: Operational methods in semantics. Lecture notes, Universit\u00e9 Denis Diderot Paris 7, December 2016. https:\/\/hal.archives-ouvertes.fr\/cel-01422101"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Arpit, Kumar, D.: Calculus of concurrent probabilistic reversible processes. In: ICCCT, pp. 34\u201340. ICCCT-2017. ACM, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3154979.3155004","DOI":"10.1145\/3154979.3155004"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Aubert, C., Cristescu, I.: Reversible barbed congruence on configuration structures. In: ICE 2015. EPTCS, vol. 189, pp. 68\u201395 (2015). https:\/\/doi.org\/10.4204\/EPTCS.189.7","DOI":"10.4204\/EPTCS.189.7"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Aubert, C., Cristescu, I.: Contextual equivalences in configuration structures and reversibility. J. Log. Algebr. Methods Program. 86(1), 77\u2013106 (2017). https:\/\/doi.org\/10.1016\/j.jlamp.2016.08.004","DOI":"10.1016\/j.jlamp.2016.08.004"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Aubert, C., Cristescu, I.: How reversibility can solve traditional questions: the example of hereditary history-preserving bisimulation. In: CONCUR. LIPIcs, vol. 2017, pp. 13:1\u201313:24. Schloss Dagstuhl (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.13","DOI":"10.4230\/LIPIcs.CONCUR.2020.13"},{"key":"9_CR7","unstructured":"Aubert, C., Cristescu, I.: Structural equivalences for reversible calculi of communicating systems (oral communication). Research report, Augusta University (2020). https:\/\/hal.archives-ouvertes.fr\/hal-02571597, communication at ICE 2020"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Aubert, C., Medi\u0107, D.: Enabling Replications and Contexts in Reversible Concurrent Calculus (Extended Version), May 2021. https:\/\/hal.archives-ouvertes.fr\/hal-03183053","DOI":"10.1007\/978-3-030-79837-6_9"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Baier, C., Kwiatkowska, M.Z.: Domain equations for probabilistic processes. MSCS 10(6), 665\u2013717 (2000). https:\/\/doi.org\/10.1017\/S0960129599002984","DOI":"10.1017\/S0960129599002984"},{"key":"9_CR10","unstructured":"Bednarczyk, M.A.: Hereditary history preserving bisimulations or what is the power of the future perfect in program logics. Technical report, Instytut Podstaw Informatyki PAN filia w Gda\u0144sku (1991). http:\/\/www.ipipan.gda.pl\/~marek\/papers\/historie.ps.gz"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Boudol, G., Castellani, I.: Permutation of transitions: an event structure semantics for CCS and SCCS. In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School\/Workshop, Noordwijkerhout, The Netherlands, 30 May\u20133 June 1988, Proceedings. LNCS, vol. 354, pp. 411\u2013427. Springer (1988). https:\/\/doi.org\/10.1007\/BFb0013028","DOI":"10.1007\/BFb0013028"},{"key":"9_CR12","unstructured":"Cox, G.: SimCCSK: simulation of the reversible process calculi CCSK. Master\u2019s thesis, University of Leicester (4 2010). https:\/\/leicester.figshare.com\/articles\/thesis\/SimCCSK_simulation_of_the_reversible_process_calculi_CCSK\/ 10091681"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Cristescu, I., Krivine, J., Varacca, D.: A compositional semantics for the reversible p-calculus. In: LICS, pp. 388\u2013397. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/LICS.2013.45","DOI":"10.1109\/LICS.2013.45"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Cristescu, I., Krivine, J., Varacca, D.: Rigid families for CCS and the $$\\pi $$-calculus. In: Theoretical Aspects of Computing - ICTAC 2015. LNCS, vol. 9399, pp. 223\u2013240. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-25150-9_14","DOI":"10.1007\/978-3-319-25150-9_14"},{"key":"9_CR15","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":"Vincent Danos","year":"2004","unstructured":"Danos, Vincent, Krivine, Jean: Reversible communicating systems. In: Gardner, Philippa, Yoshida, Nobuko (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292\u2013307. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_19"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/11539452_31","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"V Danos","year":"2005","unstructured":"Danos, V., Krivine, J.: Transactions in RCCS. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 398\u2013412. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11539452_31"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Fischer, N., van Glabbeek, R.J.: Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours. J. Log. Algebr. Methods Program. 102, 64\u2013102 (2019). https:\/\/doi.org\/10.1016\/j.jlamp.2018.09.006","DOI":"10.1016\/j.jlamp.2018.09.006"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Frank, M.P., Brocato, R.W., Tierney, B.D., Missert, N.A., Hsia, A.H.: Reversible computing with fast, fully static, fully adiabatic CMOS. In: ICRC, Atlanta, GA, USA, 1\u20133 December 2020, pp. 1\u20138. IEEE (2020). https:\/\/doi.org\/10.1109\/ICRC2020.2020.00014","DOI":"10.1109\/ICRC2020.2020.00014"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: On specifying timeouts. Electron. Notes Theor. Comput. Sci. 162, 173\u2013175 (2006). https:\/\/doi.org\/10.1016\/j.entcs.2005.12.083","DOI":"10.1016\/j.entcs.2005.12.083"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J., H\u00f6fner, P.: CCS: it\u2019s not fair! - fair schedulers cannot be implemented in ccs-like languages even under progress and certain fairness assumptions. Acta Inform. 52(2\u20133), 175\u2013205 (2015). https:\/\/doi.org\/10.1007\/s00236-015-0221-6","DOI":"10.1007\/s00236-015-0221-6"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Goubault-Larrecq, J.: Isomorphism theorems between models of mixed choice. MSCS 27(6), 1032\u20131067 (2017). https:\/\/doi.org\/10.1017\/S0960129515000547","DOI":"10.1017\/S0960129515000547"},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Graversen, E., Phillips, I., Yoshida, N.: Event structure semantics of (controlled) reversible CCS. In: RC 2018, Leicester, UK, September 12\u201314, 2018, Proceedings. LNCS, vol. 11106, pp. 102\u2013122. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_7","DOI":"10.1007\/978-3-319-99498-7_7"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Hennessy, M.: A distributed Pi-calculus. CUP (2007). https:\/\/doi.org\/10.1017\/CBO9780511611063","DOI":"10.1017\/CBO9780511611063"},{"key":"9_CR24","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Hoboken (1985)"},{"key":"9_CR25","unstructured":"Krivine, J.: Alg\u00e8bres de Processus R\u00e9versible - Programmation Concurrente D\u00e9clarative. Ph.D. thesis, Universit\u00e9 Paris 6 & INRIA Rocquencourt (2006). https:\/\/tel.archives-ouvertes.fr\/tel-00519528"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-37036-6_21","volume-title":"Programming Languages and Systems","author":"I Lanese","year":"2013","unstructured":"Lanese, I., Lienhardt, M., Mezzina, C.A., Schmitt, A., Stefani, J.-B.: Concurrent flexible reversibility. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 370\u2013390. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_21"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Lanese, I., Medi\u0107, D., Mezzina, C.A.: Static versus dynamic reversibility in CCS. Acta Informatica 1\u201334 (2021). https:\/\/doi.org\/10.1007\/s00236-019-00346-6","DOI":"10.1007\/s00236-019-00346-6"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Lanese, I., Phillips, I.C.C., Ulidowski, I.: An axiomatic approach to reversible computation. In: FOSSACS 2020, Dublin, Ireland, 25\u201330 April 2020, Proceedings. LNCS, vol. 12077, pp. 442\u2013461. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-45231-5_23","DOI":"10.1007\/978-3-030-45231-5_23"},{"key":"9_CR29","unstructured":"L\u00e9vy, J.J.: R\u00e9ductions correctes et optimales dans le lambda-calcul. Ph.D. thesis, Paris 7, January 1978. http:\/\/pauillac.inria.fr\/~levy\/pubs\/78phd.pdf"},{"key":"9_CR30","doi-asserted-by":"publisher","unstructured":"Matthews, D.: How to get started in quantum computing. Nature 591(7848), 166\u2013167, March 2021. https:\/\/doi.org\/10.1038\/d41586-021-00533-x","DOI":"10.1038\/d41586-021-00533-x"},{"key":"9_CR31","doi-asserted-by":"publisher","unstructured":"Medi\u0107, D., Mezzina, C.A.: Static VS dynamic reversibility in CCS. In: RC 2016. LNCS, vol. 9720, pp. 36\u201351. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-40578-0_3","DOI":"10.1007\/978-3-319-40578-0_3"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Medi\u0107, D., Mezzina, C.A., Phillips, I., Yoshida, N.: A parametric framework for reversible $$\\pi $$-calculi. Inf. Comput. 275, 104644 (2020). https:\/\/doi.org\/10.1016\/j.ic.2020.104644","DOI":"10.1016\/j.ic.2020.104644"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Merro, M., Zappa Nardelli, F.: Behavioral theory for mobile ambients. J. ACM 52(6), 961\u20131023 (2005). https:\/\/doi.org\/10.1145\/1101821.1101825","DOI":"10.1145\/1101821.1101825"},{"key":"9_CR34","doi-asserted-by":"publisher","unstructured":"Mezzina, C.A., Koutavas, V.: A safety and liveness theory for total reversibility. In: TASE 2017, Sophia Antipolis, France, 13\u201315 September, pp. 1\u20138. IEEE (2017). https:\/\/doi.org\/10.1109\/TASE.2017.8285635","DOI":"10.1109\/TASE.2017.8285635"},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"Milner, R.: A Calculus of Communicating Systems. LNCS, Springer-Verlag (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3","DOI":"10.1007\/3-540-10235-3"},{"key":"9_CR36","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"},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Perdrix, S., Jorrand, P.: Classically-controlled quantum computation. Electron. Notes Theor. Comput. Sci. 135(3), 119\u2013128 (2006). https:\/\/doi.org\/10.1016\/j.entcs.2005.09.026","DOI":"10.1016\/j.entcs.2005.09.026"},{"key":"9_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/11690634_17","volume-title":"Foundations of Software Science and Computation Structures","author":"I Phillips","year":"2006","unstructured":"Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FoSSaCS 2006. LNCS, vol. 3921, pp. 246\u2013260. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11690634_17"},{"key":"9_CR39","doi-asserted-by":"publisher","unstructured":"Phillips, I., Ulidowski, I.: Reversibility and models for concurrency. Electron. Notes Theor. Comput. Sci. 192(1), 93\u2013108 (2007). https:\/\/doi.org\/10.1016\/j.entcs.2007.08.018","DOI":"10.1016\/j.entcs.2007.08.018"},{"key":"9_CR40","doi-asserted-by":"publisher","unstructured":"Rosenberg, A.L.: Efficient pairing functions - and why you should care. Int. J. Found. Comput. Sci. 14(1), 3\u201317 (2003). https:\/\/doi.org\/10.1142\/S012905410300156X","DOI":"10.1142\/S012905410300156X"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: Introduction to Bisimulation and Coinduction. CUP (2011)","DOI":"10.1017\/CBO9780511777110"},{"key":"9_CR42","unstructured":"Sangiorgi, D., Walker, D.: The Pi-calculus. CUP (2001)"},{"key":"9_CR43","unstructured":"Szudzik, M.P.: The Rosenberg-strong pairing function. CoRR abs\/1706.04129 (2017)"},{"key":"9_CR44","doi-asserted-by":"publisher","unstructured":"de Visme, M.: Event structures for mixed choice. In: CONCUR. LIPIcs, vol. 140, pp. 11:1\u201311:16. Schloss Dagstuhl (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2019.11","DOI":"10.4230\/LIPIcs.CONCUR.2019.11"}],"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-030-79837-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T04:37:10Z","timestamp":1672547830000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79837-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030798369","9783030798376"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79837-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 June 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/reversible-computation-2021.github.io\/","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":"21","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":"0","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":"52% - 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)"}}]}}