{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T12:47:40Z","timestamp":1784206060285,"version":"3.55.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030798369","type":"print"},{"value":"9783030798376","type":"electronic"}],"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_10","type":"book-chapter","created":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T11:03:03Z","timestamp":1624359783000},"page":"163-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Reversibility and Predictions"],"prefix":"10.1007","author":[{"given":"Martin","family":"Vassor","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,23]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Berry, G., Boudol, G.: The chemical abstract machine. In: Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1990, pp. 81\u201394 (1989). https:\/\/doi.org\/10.1145\/96709.96717","DOI":"10.1145\/96709.96717"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G Berry","year":"1992","unstructured":"Berry, G., Boudol, G.: The chemical abstract machine. Theoret. Comput. Sci. 96(1), 217\u2013248 (1992). https:\/\/doi.org\/10.1016\/0304-3975(92)90185-I","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-00945-7_6","volume-title":"Trustworthy Global Computing","author":"L Caires","year":"2009","unstructured":"Caires, L., Ferreira, C., Vieira, H.: A process calculus analysis of compensations. In: Kaklamanis, C., Nielson, F. (eds.) TGC 2008. LNCS, vol. 5474, pp. 87\u2013103. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00945-7_6"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-54804-8_26","volume-title":"Fundamental Approaches to Software Engineering","author":"E Giachino","year":"2014","unstructured":"Giachino, E., Lanese, I., Mezzina, C.A.: Causal-consistent reversible debugging. In: Gnesi, S., Rensink, A. (eds.) FASE 2014. LNCS, vol. 8411, pp. 370\u2013384. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54804-8_26"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-47361-7_7","volume-title":"Reversible Computation: Extending Horizons of Computing","author":"S Kuhn","year":"2020","unstructured":"Kuhn, S., Aman, B., Ciobanu, G., Philippou, A., Psara, K., Ulidowski, I.: Reversibility in chemical reactions. In: Ulidowski, I., Lanese, I., Schultz, U.P., Ferreira, C. (eds.) RC 2020. LNCS, vol. 12070, pp. 151\u2013176. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-47361-7_7"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Kuhn, S., Ulidowski, I.: A Calculus for Local Reversibility (2016). https:\/\/core.ac.uk\/display\/191241654","DOI":"10.1007\/978-3-319-40578-0_2"},{"key":"10_CR7","unstructured":"Kuhn, S., Ulidowski, I.: Local reversibility in a Calculus of Covalent Bonding (2017). https:\/\/core.ac.uk\/display\/328692337?source=3. Publisher: \u2018Elsevier BV\u2019"},{"key":"10_CR8","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":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-23217-6_20","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"I Lanese","year":"2011","unstructured":"Lanese, I., Mezzina, C.A., Schmitt, A., Stefani, J.-B.: Controlling reversibility in higher-order Pi. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 297\u2013311. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23217-6_20"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-642-15375-4_33","volume-title":"CONCUR 2010 - Concurrency Theory","author":"I Lanese","year":"2010","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.-B.: Reversing higher-order Pi. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 478\u2013493. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_33"},{"key":"10_CR11","unstructured":"Mezzina, C.A.: Reversing execution in Higher-Order Pi. Theses, Universit\u00e9 de Grenoble, February 2012. https:\/\/tel.archives-ouvertes.fr\/tel-00683964"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-99498-7_5","volume-title":"Reversible Computation","author":"CA Mezzina","year":"2018","unstructured":"Mezzina, C.A.: On reversibility and broadcast. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 67\u201383. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_5"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","year":"1980","unstructured":"Milner, R. (ed.): A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3"},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10586-013-0277-4","volume":"17","author":"KS Perumalla","year":"2013","unstructured":"Perumalla, K.S., Park, A.J.: Reverse computation for rollback-based fault tolerance in large parallel systems. Clust. Comput. 17(2), 303\u2013313 (2013). https:\/\/doi.org\/10.1007\/s10586-013-0277-4","journal-title":"Clust. Comput."},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-99498-7_6","volume-title":"Reversible Computation","author":"A Philippou","year":"2018","unstructured":"Philippou, A., Psara, K.: Reversible computation in petri nets. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 84\u2013101. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_6"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-36315-3_18","volume-title":"Reversible Computation","author":"I Phillips","year":"2013","unstructured":"Phillips, I., Ulidowski, I., Yuen, S.: A reversible process calculus and the modelling of the ERK signalling pathway. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 218\u2013232. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36315-3_18"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Sangiorgi, D.: Introduction to Bisimulation and Coinduction. University Press, Cambridge (2011). https:\/\/doi.org\/10.1017\/CBO9780511777110","DOI":"10.1017\/CBO9780511777110"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-319-99498-7_20","volume-title":"Reversible Computation","author":"M Vassor","year":"2018","unstructured":"Vassor, M., Stefani, J.-B.: Checkpoint\/rollback vs causally-consistent reversibility. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 286\u2013303. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_20"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:07:40Z","timestamp":1625008060000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79837-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030798369","9783030798376"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79837-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}