{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T23:35:40Z","timestamp":1790811340176,"version":"4.1.0"},"publisher-location":"Cham","reference-count":186,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030473600","type":"print"},{"value":"9783030473617","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,5,12]],"date-time":"2020-05-12T00:00:00Z","timestamp":1589241600000},"content-version":"vor","delay-in-days":132,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Reversible computation allows computation to proceed not only in the standard, forward direction, but also backward, recovering past states. While reversible computation has attracted interest for its multiple applications, covering areas as different as low-power computing, simulation, robotics and debugging, such applications need to be supported by a clear understanding of the foundations of reversible computation. We report below on many threads of research in the area of foundations of reversible computing, giving particular emphasis to the results obtained in the framework of the European COST Action IC1405, entitled \u201cReversible Computation - Extending Horizons of Computing\u201d, which took place in the years 2015\u20132019.<\/jats:p>","DOI":"10.1007\/978-3-030-47361-7_1","type":"book-chapter","created":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T15:10:54Z","timestamp":1589382654000},"page":"1-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Foundations of Reversible Computation"],"prefix":"10.1007","author":[{"given":"Bogdan","family":"Aman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gabriel","family":"Ciobanu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Gl\u00fcck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robin","family":"Kaarsgaard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jarkko","family":"Kari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Kutrib","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ivan","family":"Lanese","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claudio Antares","family":"Mezzina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"\u0141ukasz","family":"Mikulski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rajagopal","family":"Nagarajan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Iain","family":"Phillips","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G. Michele","family":"Pinna","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luca","family":"Prigioniero","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Irek","family":"Ulidowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Germ\u00e1n","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,5,12]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-61604-7_44","volume-title":"CONCUR \u201996: Concurrency Theory","author":"S Abramsky","year":"1996","unstructured":"Abramsky, S.: Retracing some paths in process algebra. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 1\u201317. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61604-7_44"},{"issue":"3","key":"1_CR2","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/j.tcs.2005.07.002","volume":"347","author":"S Abramsky","year":"2005","unstructured":"Abramsky, S.: A structural approach to reversible computation. Theoret. Comput. Sci. 347(3), 441\u2013464 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols. In: Logic in Computer Science, LICS 2004, pp. 415\u2013425. IEEE (2004)","DOI":"10.1109\/LICS.2004.1319636"},{"issue":"5","key":"1_CR4","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1017\/S0960129502003730","volume":"12","author":"S Abramsky","year":"2002","unstructured":"Abramsky, S., Haghverdi, E., Scott, P.: Geometry of interaction and linear combinatory algebras. Math. Struct. Comput. Sci. 12(5), 625\u2013665 (2002)","journal-title":"Math. Struct. Comput. Sci."},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-95885-7_7","volume-title":"Membrane Computing","author":"O Agrigoroaiei","year":"2009","unstructured":"Agrigoroaiei, O., Ciobanu, G.: Dual P systems. In: Corne, D.W., Frisco, P., P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2008. LNCS, vol. 5391, pp. 95\u2013107. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-95885-7_7"},{"issue":"3\u20135","key":"1_CR6","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.jlap.2010.03.003","volume":"79","author":"O Agrigoroaiei","year":"2010","unstructured":"Agrigoroaiei, O., Ciobanu, G.: Reversing computation in membrane systems. J. Logic Algebraic Program. 79(3\u20135), 278\u2013288 (2010)","journal-title":"J. Logic Algebraic Program."},{"issue":"7","key":"1_CR7","first-page":"692","volume":"23","author":"B Aman","year":"2017","unstructured":"Aman, B., Ciobanu, G.: Reversibility in parallel rewriting systems. J. Univers. Comput. Sci. 23(7), 692\u2013703 (2017)","journal-title":"J. Univers. Comput. Sci."},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-73359-3_3","volume-title":"Membrane Computing","author":"B Aman","year":"2018","unstructured":"Aman, B., Ciobanu, G.: Controlled reversibility in reaction systems. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) CMC 2017. LNCS, vol. 10725, pp. 40\u201353. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73359-3_3"},{"issue":"3","key":"1_CR9","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D Angluin","year":"1982","unstructured":"Angluin, D.: Inference of reversible languages. J. ACM 29(3), 741\u2013765 (1982)","journal-title":"J. ACM"},{"issue":"4","key":"1_CR10","doi-asserted-by":"crossref","first-page":"28:1","DOI":"10.1145\/3231597","volume":"19","author":"E Ardeshir-Larijani","year":"2018","unstructured":"Ardeshir-Larijani, E., Gay, S.J., Nagarajan, R.: Automated equivalence checking of concurrent quantum systems. ACM Trans. Comput. Logic 19(4), 28:1\u201328:32 (2018)","journal-title":"ACM Trans. Comput. Logic"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-38986-3_9","volume-title":"Reversible Computation","author":"HB Axelsen","year":"2013","unstructured":"Axelsen, H.B., Gl\u00fcck, R.: Reversible representation and manipulation of constructor terms in the heap. In: Dueck, G.W., Miller, D.M. (eds.) RC 2013. LNCS, vol. 7948, pp. 96\u2013109. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38986-3_9"},{"issue":"5","key":"1_CR12","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s00236-015-0253-y","volume":"53","author":"HB Axelsen","year":"2016","unstructured":"Axelsen, H.B., Gl\u00fcck, R.: On reversible turing machines and their function universality. Acta Inf. 53(5), 509\u2013543 (2016)","journal-title":"Acta Inf."},{"key":"1_CR13","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1142\/S0129054117400044","volume":"28","author":"HB Axelsen","year":"2017","unstructured":"Axelsen, H.B., Holzer, M., Kutrib, M.: The degree of irreversibility in deterministic finite automata. Int. J. Found. Comput. Sci. 28, 503\u2013522 (2017)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-3-319-30000-9_44","volume-title":"Language and Automata Theory and Applications","author":"HB Axelsen","year":"2016","unstructured":"Axelsen, H.B., Holzer, M., Kutrib, M., Malcher, A.: Reversible shrinking two-pushdown automata. In: Dediu, A.-H., Janou\u0161ek, J., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2016. LNCS, vol. 9618, pp. 579\u2013591. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30000-9_44"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-20860-2_2","volume-title":"Reversible Computation","author":"HB Axelsen","year":"2015","unstructured":"Axelsen, H.B., Jakobi, S., Kutrib, M., Malcher, A.: A hierarchy of fast reversible turing machines. In: Krivine, J., Stefani, J.-B. (eds.) RC 2015. LNCS, vol. 9138, pp. 29\u201344. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20860-2_2"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-40578-0_6","volume-title":"Reversible Computation","author":"HB Axelsen","year":"2016","unstructured":"Axelsen, H.B., Kutrib, M., Malcher, A., Wendlandt, M.: Boosting reversible pushdown machines by preprocessing. In: Devitt, S., Lanese, I. (eds.) RC 2016. LNCS, vol. 9720, pp. 89\u2013104. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40578-0_6"},{"key":"1_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22944-2_1","volume-title":"Algebra and Coalgebra in Computer Science","author":"G Bacci","year":"2011","unstructured":"Bacci, G., Danos, V., Kammar, O.: On the statistical thermodynamics of reversible communicating processes. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol. 6859, pp. 1\u201318. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22944-2_1"},{"key":"1_CR19","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47967-4","volume-title":"Petri Net Synthesis","author":"E Badouel","year":"2015","unstructured":"Badouel, E., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. TTCSAES. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47967-4"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-39519-7_2","volume-title":"Coordination Models and Languages","author":"F Barbanera","year":"2016","unstructured":"Barbanera, F., de\u2019Liguoro, U.: A game interpretation of retractable contracts. In: Lluch Lafuente, A., Proen\u00e7a, J. (eds.) COORDINATION 2016. LNCS, vol. 9686, pp. 18\u201334. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39519-7_2"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Barbanera, F., Dezani-Ciancaglini, M., de\u2019Liguoro, U.: Compliance for reversible client\/server interactions. In: Workshop on Behavioural Types, BEAT 2014. EPTCS, vol. 162, pp. 35\u201342 (2014)","DOI":"10.4204\/EPTCS.162.5"},{"issue":"4","key":"1_CR22","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/s00165-016-0358-2","volume":"28","author":"F Barbanera","year":"2016","unstructured":"Barbanera, F., Dezani-Ciancaglini, M., de\u2019Liguoro, U.: Reversible client\/server interactions. Formal Asp. Comput. 28(4), 697\u2013722 (2016)","journal-title":"Formal Asp. Comput."},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Barbanera, F., Dezani-Ciancaglini, M., Lanese, I., de\u2019Liguoro, U.: Retractable contracts. In: Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software, PLACES 2015. EPTCS, vol. 203, pp. 61\u201372 (2015)","DOI":"10.4204\/EPTCS.203.5"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-319-59746-1_7","volume-title":"Coordination Models and Languages","author":"F Barbanera","year":"2017","unstructured":"Barbanera, F., Lanese, I., de\u2019Liguoro, U.: Retractable and speculative contracts. In: Jacquet, J.-M., Massink, M. (eds.) COORDINATION 2017. LNCS, vol. 10319, pp. 119\u2013137. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59746-1_7"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-39300-1_5","volume-title":"Cellular Automata and Discrete Complex Systems","author":"S Barbieri","year":"2016","unstructured":"Barbieri, S., Kari, J., Salo, V.: The group of reversible turing machines. In: Cook, M., Neary, T. (eds.) AUTOMATA 2016. LNCS, vol. 9664, pp. 49\u201362. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39300-1_5"},{"issue":"4","key":"1_CR26","first-page":"341","volume":"157","author":"K Barylska","year":"2018","unstructured":"Barylska, K., Erofeev, E., Koutny, M., Mikulski, \u0141., Pi\u0105tkowski, M.: Reversing transitions in bounded Petri nets. Fund. Inf. 157(4), 341\u2013357 (2018)","journal-title":"Fund. Inf."},{"key":"1_CR27","unstructured":"Barylska, K., Gogoli\u0144ska, A., Mikulski, \u0141., Philippou, A., Pi\u0105tkowski, M., Psara, K.: Reversing computations modelled by coloured Petri nets. In: Workshop on Algorithms & Theories for the Analysis of Event Data. CEUR Workshop Proceedings, vol. 2115, pp. 91\u2013111. CEUR-WS.org (2018)"},{"key":"1_CR28","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.scico.2017.10.008","volume":"151","author":"K Barylska","year":"2018","unstructured":"Barylska, K., Koutny, M., Mikulski, \u0141., Pi\u0105tkowski, M.: Reversible computation vs. reversibility in Petri nets. Sci. Comput. Program. 151, 48\u201360 (2018)","journal-title":"Sci. Comput. Program."},{"key":"1_CR29","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: Conference on Computers, Systems & Signal Processing, CSSP 1984, pp. 175\u2013179 (1984)"},{"issue":"1","key":"1_CR30","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 96(1), 217\u2013248 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart (1979)"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Boender, J., Kamm\u00fcller, F., Nagarajan, R.: Formalization of quantum protocols using Coq. In: Workshop on Quantum Physics and Logic, QPL 2015, pp. 71\u201383 (2015)","DOI":"10.4204\/EPTCS.195.6"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Bouziane, Z., Finkel, A.: Cyclic Petri net reachability sets are semi-linear effectively constructible. In: Workshop on Verification of Infinite State Systems, INFINITY 1997, ENTCS, pp. 15\u201324. Elsevier (1997)","DOI":"10.1016\/S1571-0661(05)80423-2"},{"key":"1_CR34","unstructured":"Bowman, W.J., James, R.P., Sabry, A.: Dagger traced symmetric monoidal categories and reversible programming. In: Reversible Computation, RC 2011, pp. 51\u201356. Ghent University (2011)"},{"issue":"2","key":"1_CR35","first-page":"175","volume":"21","author":"L Cardelli","year":"2011","unstructured":"Cardelli, L., Laneve, C.: Reversibility in massive concurrent systems. Sci. Ann. Comp. Sci. 21(2), 175\u2013198 (2011)","journal-title":"Sci. Ann. Comp. Sci."},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Laneve, C.: Reversible structures. In: Computational Methods in Systems Biology, CMSB 2011, pp. 131\u2013140. ACM (2011)","DOI":"10.1145\/2037509.2037529"},{"issue":"3","key":"1_CR37","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/347823.347828","volume":"9","author":"CD Carothers","year":"1999","unstructured":"Carothers, C.D., Perumalla, K.S., Fujimoto, R.: Efficient optimistic parallel simulations using reverse computation. ACM Trans. Model. Comput. Simul. 9(3), 224\u2013253 (1999)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"1_CR38","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.jcss.2016.10.004","volume":"84","author":"J Cassaigne","year":"2017","unstructured":"Cassaigne, J., Ollinger, N., Torres-Avil\u00e9s, R.: A small minimal aperiodic reversible Turing machine. J. Comput. Syst. Sci. 84, 288\u2013301 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"1_CR39","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0304-3975(01)00359-0","volume":"285","author":"M Clavel","year":"2002","unstructured":"Clavel, M., et al.: Maude: specification and programming in rewriting logic. Theor. Comput. Sci. 285(2), 187\u2013243 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"1_CR40","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0304-3975(00)00382-0","volume":"270","author":"JRB Cockett","year":"2002","unstructured":"Cockett, J.R.B., Lack, S.: Restriction categories I: categories of partial maps. Theoret. Comput. Sci. 270(1\u20132), 223\u2013259 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-21834-7_20","volume-title":"Applications and Theory of Petri Nets","author":"M Colange","year":"2011","unstructured":"Colange, M., Baarir, S., Kordon, F., Thierry-Mieg, Y.: Crocodile: a symbolic\/symbolic tool for the analysis of symmetric nets with bag. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol. 6709, pp. 338\u2013347. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21834-7_20"},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"Cristescu, I., Krivine, J., Varacca, D.: A compositional semantics for the reversible $$\\pi $$-calculus. In: Logic in Computer Science, LICS 2013, pp. 388\u2013397. IEEE Computer Society (2013)","DOI":"10.1109\/LICS.2013.45"},{"key":"1_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-319-99498-7_19","volume-title":"Reversible Computation","author":"MH Cservenka","year":"2018","unstructured":"Cservenka, M.H., Gl\u00fcck, R., Haulund, T., Mogensen, T.\u00c6.: Data structures and dynamic memory management in reversible languages. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 269\u2013285. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_19"},{"key":"1_CR44","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":"1_CR45","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":"#cr-split#-1_CR46.1","doi-asserted-by":"crossref","unstructured":"Danos, V., Krivine, J.: Formal molecular biology done in CCS-R. In: Workshop on Concurrent Models in Molecular Biology, BioConcur 2003, vol. 180","DOI":"10.1016\/j.entcs.2004.01.040"},{"key":"#cr-split#-1_CR46.2","unstructured":"(3) (2003). Electr. Notes Theor. Comput. Sci., 31-49. Elsevier (2007)"},{"key":"1_CR47","unstructured":"Dartois, L., Fournier, P., Jecker, I., Lhote, N.: On reversible transducers. In: International Colloquium on Automata, Languages, and Programming, ICALP 2017. LIPIcs, vol. 80, pp. 113:1\u2013113:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"1_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-319-91268-4_11","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"D de Frutos Escrig","year":"2018","unstructured":"de Frutos Escrig, D., Koutny, M., Mikulski, \u0141.: An efficient characterization of Petri net solvable binary words. In: Khomenko, V., Roux, O.H. (eds.) PETRI NETS 2018. LNCS, vol. 10877, pp. 207\u2013226. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91268-4_11"},{"key":"1_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-030-21571-2_11","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"D de Frutos Escrig","year":"2019","unstructured":"de Frutos Escrig, D., Koutny, M., Mikulski, \u0141.: Reversing steps in Petri nets. In: Donatelli, S., Haar, S. (eds.) PETRI NETS 2019. LNCS, vol. 11522, pp. 171\u2013191. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21571-2_11"},{"key":"1_CR50","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R De Nicola","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theor. Comput. Sci. 34, 83\u2013133 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-319-58741-7_23","volume-title":"Unveiling Dynamics and Complexity","author":"M Delacourt","year":"2017","unstructured":"Delacourt, M., Ollinger, N.: Permutive one-way cellular automata and the finiteness problem for automaton groups. In: Kari, J., Manea, F., Petre, I. (eds.) CiE 2017. LNCS, vol. 10307, pp. 234\u2013245. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58741-7_23"},{"key":"1_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-319-71069-3_21","volume-title":"Theory and Practice of Natural Computing","author":"A Di Pierro","year":"2017","unstructured":"Di Pierro, A., Mengoni, R., Nagarajan, R., Windridge, D.: Hamming distance kernelisation via topological quantum computation. In: Mart\u00edn-Vide, C., Neruda, R., Vega-Rodr\u00edguez, M.A. (eds.) TPNC 2017. LNCS, vol. 10687, pp. 269\u2013280. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71069-3_21"},{"issue":"1","key":"1_CR53","first-page":"263","volume":"75","author":"A Ehrenfeucht","year":"2007","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Reaction systems. Fund. Inf. 75(1), 263\u2013280 (2007)","journal-title":"Fund. Inf."},{"key":"1_CR54","doi-asserted-by":"crossref","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for Petri nets. BRICS Rep. Ser. 1(8) (1994)","DOI":"10.7146\/brics.v1i8.21662"},{"key":"1_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-32202-0_1","volume-title":"Generic and Indexed Programming","author":"N Foster","year":"2012","unstructured":"Foster, N., Matsuda, K., Voigtl\u00e4nder, J.: Three complementary approaches to bidirectional programming. In: Gibbons, J. (ed.) Generic and Indexed Programming. LNCS, vol. 7470, pp. 1\u201346. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32202-0_1"},{"key":"1_CR56","doi-asserted-by":"crossref","unstructured":"Giachino, E., Lanese, I., Mezzina, C.A., Tiezzi, F.: Causal-consistent reversibility in a tuple-based language. In: Parallel, Distributed, and Network-Based Processing, PDP 2015, pp. 467\u2013475. IEEE Computer Society (2015)","DOI":"10.1109\/PDP.2015.98"},{"key":"1_CR57","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.jlamp.2016.09.003","volume":"88","author":"E Giachino","year":"2017","unstructured":"Giachino, E., Lanese, I., Mezzina, C.A., Tiezzi, F.: Causal-consistent rollback in a tuple-based language. J. Log. Algebr. Meth. Program. 88, 99\u2013120 (2017)","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"1_CR58","unstructured":"Giles, B.G.: An investigation of some theoretical aspects of reversible computing. Ph.D. thesis, University of Calgary (2014)"},{"key":"1_CR59","doi-asserted-by":"crossref","unstructured":"Gl\u00fcck, R., Kaarsgaard, R.: A categorical foundation for structured reversible flowchart languages. In: Mathematical Foundations of Programming Semantics, MFPS 2018. Electronic Notes in Theoretical Computer Science, vol. 341, pp. 155\u2013171. Elsevier (2018)","DOI":"10.1016\/j.entcs.2018.03.021"},{"key":"1_CR60","doi-asserted-by":"crossref","unstructured":"Gl\u00fcck, R., Kaarsgaard, R.: A categorical foundation for structured reversible flowchart languages: soundness and adequacy. Logical Methods Comput. Sci. 14(3) (2018)","DOI":"10.1016\/j.entcs.2018.03.021"},{"key":"1_CR61","doi-asserted-by":"crossref","unstructured":"Gl\u00fcck, R., Kaarsgaard, R., Yokoyama, T.: Reversible programs have reversible semantics. In: Reversibility in Programming, Languages, and Automata, RPLA 2019. Lecture Notes in Computer Science. Springer (2019, to appear)","DOI":"10.1007\/978-3-030-54997-8_26"},{"issue":"3","key":"1_CR62","first-page":"108","volume":"33","author":"R Gl\u00fcck","year":"2016","unstructured":"Gl\u00fcck, R., Yokoyama, T.: A linear-time self-interpreter of a reversible imperative language. Comput. Soft. 33(3), 108\u2013128 (2016)","journal-title":"Comput. Soft."},{"issue":"5","key":"1_CR63","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1587\/transinf.2016EDP7274","volume":"E100\u2013D","author":"R Gl\u00fcck","year":"2017","unstructured":"Gl\u00fcck, R., Yokoyama, T.: A minimalist\u2019s reversible while language. IEICE Trans. Inf. Syst. E100\u2013D(5), 1026\u20131034 (2017)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"1_CR64","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.ipl.2019.03.002","volume":"147","author":"R Gl\u00fcck","year":"2019","unstructured":"Gl\u00fcck, R., Yokoyama, T.: Constructing a binary tree from its traversals by reversible recursion and iteration. Inf. Process. Lett. 147, 32\u201337 (2019)","journal-title":"Inf. Process. Lett."},{"key":"1_CR65","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.jlamp.2019.01.001","volume":"104","author":"E Graversen","year":"2019","unstructured":"Graversen, E., Phillips, I., Yoshida, N.: Towards a categorical representation of reversible event structures. J. Logical Algebraic Methods Program. 104, 16\u201359 (2019)","journal-title":"J. Logical Algebraic Methods Program."},{"key":"1_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-319-98654-8_29","volume-title":"Developments in Language Theory","author":"B Guillon","year":"2018","unstructured":"Guillon, B., Kutrib, M., Malcher, A., Prigioniero, L.: Reversible pushdown transducers. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 354\u2013365. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98654-8_29"},{"key":"1_CR67","unstructured":"Guo, X.: Products, joins, meets, and ranges in restriction categories. Ph.D. thesis, University of Calgary (2012)"},{"key":"1_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-59936-6_5","volume-title":"Reversible Computation","author":"T Haulund","year":"2017","unstructured":"Haulund, T., Mogensen, T.\u00c6., Gl\u00fcck, R.: Implementing reversible object-oriented language features on reversible machines. In: Phillips, I., Rahaman, H. (eds.) RC 2017. LNCS, vol. 10301, pp. 66\u201373. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59936-6_5"},{"issue":"4","key":"1_CR69","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF01691062","volume":"3","author":"GA Hedlund","year":"1969","unstructured":"Hedlund, G.A.: Endomorphisms and automorphisms of the shift dynamical systems. Mathe. Syst. Theor. 3(4), 320\u2013375 (1969)","journal-title":"Mathe. Syst. Theor."},{"key":"1_CR70","doi-asserted-by":"crossref","unstructured":"Heunen, C., Kaarsgaard, R., Karvonen, M.: Reversible effects as inverse arrows. In: Mathematical Foundations of Programming Semantics, MFPS XXXIV. Electronic Notes in Theoretical Computer Science, vol. 341, pp. 179\u2013199. Elsevier (2018)","DOI":"10.1016\/j.entcs.2018.11.009"},{"key":"1_CR71","first-page":"1016","volume":"31","author":"C Heunen","year":"2016","unstructured":"Heunen, C., Karvonen, M.: Monads on dagger categories. Theor. Appl. Categories 31, 1016\u20131043 (2016)","journal-title":"Theor. Appl. Categories"},{"key":"1_CR72","doi-asserted-by":"crossref","unstructured":"Hoey, J., Ulidowski, I., Yuen, S.: Reversing parallel programs with blocks and procedures. In: Expressiveness in Concurrency\/Structural Operational Semantics. Electronic Proceedings in Theoretical Computer Science, vol. 276, pp. 69\u201386 (2018)","DOI":"10.4204\/EPTCS.276.7"},{"issue":"2","key":"1_CR73","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1142\/S0129054118400063","volume":"29","author":"M Holzer","year":"2018","unstructured":"Holzer, M., Jakobi, S., Kutrib, M.: Minimal reversible deterministic finite automata. Int. J. Found. Comput. Sci. 29(2), 251\u2013270 (2018)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"1_CR74","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-59936-6_3","volume-title":"Reversible Computation","author":"M Holzer","year":"2017","unstructured":"Holzer, M., Kutrib, M.: Reversible nondeterministic finite automata. In: Phillips, I., Rahaman, H. (eds.) RC 2017. LNCS, vol. 10301, pp. 35\u201351. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59936-6_3"},{"key":"1_CR75","unstructured":"Hu, Z., Sch\u00fcrr, A., Stevens, P., Terwilliger, J.F.: Bidirectional transformation \u201cbx\u201d (Dagstuhl Seminar 11031). Dagstuhl Reports 1(1), 42\u201367 (2011). http:\/\/drops.dagstuhl.de\/volltexte\/2011\/3144\/"},{"key":"1_CR76","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-10009-1_25","volume-title":"5th Conference on Automated Deduction Les Arcs, France, July 8\u201311, 1980","author":"J-M Hullot","year":"1980","unstructured":"Hullot, J.-M.: Canonical forms and unification. In: Bibel, W., Kowalski, R. (eds.) CADE 1980. LNCS, vol. 87, pp. 318\u2013334. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10009-1_25"},{"issue":"1","key":"1_CR77","first-page":"3:1","volume":"49","author":"H H\u00fcttel","year":"2016","unstructured":"H\u00fcttel, H., et al.: Foundations of session types and behavioural contracts. ACM Comput. Surv. 49(1), 3:1\u20133:36 (2016)","journal-title":"ACM Comput. Surv."},{"key":"1_CR78","unstructured":"European COST Action IC1405 on \u201cReversible Computation - Extending Horizons of Computing\u201d. http:\/\/www.revcomp.eu\/"},{"issue":"3","key":"1_CR79","first-page":"1","volume":"11","author":"B Jacobs","year":"2015","unstructured":"Jacobs, B.: New directions in categorical logic, for classical, probabilistic and quantum logic. Logical Methods Comput. Sci. 11(3), 1\u201376 (2015)","journal-title":"Logical Methods Comput. Sci."},{"key":"1_CR80","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-319-99498-7_21","volume-title":"Reversible Computation","author":"PAH Jacobsen","year":"2018","unstructured":"Jacobsen, P.A.H., Kaarsgaard, R., Thomsen, M.K.: $$\\sf CoreFun$$: a typed functional reversible core language. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 304\u2013321. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_21"},{"key":"1_CR81","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-319-73117-9_16","volume-title":"SOFSEM 2018: Theory and Practice of Computer Science","author":"J Jalonen","year":"2018","unstructured":"Jalonen, J., Kari, J.: Conjugacy of one-dimensional one-sided cellular automata is undecidable. In: Tjoa, A.M., Bellatreche, L., Biffl, S., van Leeuwen, J., Wiedermann, J. (eds.) SOFSEM 2018. LNCS, vol. 10706, pp. 227\u2013238. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73117-9_16"},{"key":"1_CR82","unstructured":"James, R.P., Sabry, A.: Theseus: a high level language for reversible computing. In: Work-in-Progress Report Presented at RC 2014. http:\/\/www.cs.indiana.edu\/~sabry\/papers\/theseus.pdf"},{"issue":"1","key":"1_CR83","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/2103621.2103667","volume":"47","author":"RP James","year":"2012","unstructured":"James, R.P., Sabry, A.: Information effects. ACM SIGPLAN Not. 47(1), 73\u201384 (2012)","journal-title":"ACM SIGPLAN Not."},{"key":"1_CR84","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2003.001.0001","volume-title":"Computability and Complexity: From a Programming Language Perspective. Foundations of Computing","author":"ND Jones","year":"1997","unstructured":"Jones, N.D.: Computability and Complexity: From a Programming Language Perspective. Foundations of Computing. MIT Press, Cambridge (1997)"},{"issue":"3","key":"1_CR85","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1017\/S0305004100074338","volume":"119","author":"A Joyal","year":"1996","unstructured":"Joyal, A., Street, R., Verity, D.: Traced monoidal categories. Math. Proc. Cambridge Philos. Soc. 119(3), 447\u2013468 (1996)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"1_CR86","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.jlamp.2016.08.003","volume":"87","author":"R Kaarsgaard","year":"2017","unstructured":"Kaarsgaard, R., Axelsen, H.B., Gl\u00fcck, R.: Join inverse categories and reversible recursion. J. Logical Algebraic Methods Program. 87, 33\u201350 (2017)","journal-title":"J. Logical Algebraic Methods Program."},{"issue":"3","key":"1_CR87","first-page":"1","volume":"14","author":"R Kaarsgaard","year":"2018","unstructured":"Kaarsgaard, R., Gl\u00fcck, R.: A categorical foundation for structured reversible flowchart languages: soundness and adequacy. Logical Methods Comput. Sci. 14(3), 1\u201338 (2018)","journal-title":"Logical Methods Comput. Sci."},{"issue":"1","key":"1_CR88","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0167-2789(90)90195-U","volume":"45","author":"J Kari","year":"1990","unstructured":"Kari, J.: Reversibility of 2D cellular automata is undecidable. Physica D 45(1), 379\u2013385 (1990)","journal-title":"Physica D"},{"key":"1_CR89","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.tcs.2011.12.037","volume":"429","author":"J Kari","year":"2012","unstructured":"Kari, J.: Universal pattern generation by cellular automata. Theoret. Comput. Sci. 429, 180\u2013184 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"1_CR90","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s00354-018-0034-6","volume":"36","author":"J Kari","year":"2018","unstructured":"Kari, J.: Reversible cellular automata: from fundamental classical results to recent developments. New Generation Comput. 36(3), 145\u2013172 (2018)","journal-title":"New Generation Comput."},{"issue":"4","key":"1_CR91","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1051\/ita\/2017014","volume":"51","author":"J Kari","year":"2017","unstructured":"Kari, J., Kopra, J.: Cellular automata and powers of p\/q. RAIRO - Theor. Inf. Applic. 51(4), 191\u2013204 (2017)","journal-title":"RAIRO - Theor. Inf. Applic."},{"key":"1_CR92","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-540-85238-4_34","volume-title":"Mathematical Foundations of Computer Science 2008","author":"J Kari","year":"2008","unstructured":"Kari, J., Ollinger, N.: Periodicity and immortality in reversible computing. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 419\u2013430. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85238-4_34"},{"key":"1_CR93","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-319-92675-9_6","volume-title":"Cellular Automata and Discrete Complex Systems","author":"J Kari","year":"2018","unstructured":"Kari, J., Salo, V., Worsch, T.: Sequentializing cellular automata. In: Baetens, J.M., Kutrib, M. (eds.) AUTOMATA 2018. LNCS, vol. 10875, pp. 72\u201387. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92675-9_6"},{"key":"1_CR94","unstructured":"Karvonen, M.: The way of the dagger. Ph.D. thesis, School of Informatics, University of Edinburgh (2019)"},{"key":"1_CR95","doi-asserted-by":"crossref","unstructured":"Kastl, J.: Inverse categories. In: Algebraische Modelle, Kategorien und Gruppoide. Studien zur Algebra und ihre Anwendungen, vol. 7, pp. 51\u201360. Akademie-Verlag (1979)","DOI":"10.1515\/9783112708651-006"},{"key":"1_CR96","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-30557-6_17","volume-title":"Practical Aspects of Declarative Languages","author":"M Kawabe","year":"2005","unstructured":"Kawabe, M., Gl\u00fcck, R.: The program inverter LRinv and its structure. In: Hermenegildo, M.V., Cabeza, D. (eds.) PADL 2005. LNCS, vol. 3350, pp. 219\u2013234. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30557-6_17"},{"issue":"1","key":"1_CR97","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/T-C.1974.223773","volume":"23","author":"R Keller","year":"1974","unstructured":"Keller, R.: Towards a theory of universal speed-independent modules. IEEE Trans. Comput. 23(1), 21\u201333 (1974)","journal-title":"IEEE Trans. Comput."},{"key":"1_CR98","unstructured":"Klop, J.W.: Term rewriting systems. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. I, pp. 1\u2013112. Oxford University Press (1992)"},{"issue":"10","key":"1_CR99","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/365628.365655","volume":"8","author":"KC Knowlton","year":"1965","unstructured":"Knowlton, K.C.: A fast storage allocator. Commun. ACM 8(10), 623\u2013625 (1965)","journal-title":"Commun. ACM"},{"key":"1_CR100","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-92675-9_7","volume-title":"Cellular Automata and Discrete Complex Systems","author":"J Kopra","year":"2018","unstructured":"Kopra, J.: Glider automorphisms on some shifts of finite type and a finitary Ryan\u2019s theorem. In: Baetens, J.M., Kutrib, M. (eds.) AUTOMATA 2018. LNCS, vol. 10875, pp. 88\u201399. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92675-9_7"},{"key":"1_CR101","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-642-36315-3_17","volume-title":"Reversible Computation","author":"J Krivine","year":"2013","unstructured":"Krivine, J.: A verification technique for reversible process algebra. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 204\u2013217. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36315-3_17"},{"key":"1_CR102","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-40578-0_2","volume-title":"Reversible Computation","author":"S Kuhn","year":"2016","unstructured":"Kuhn, S., Ulidowski, I.: A calculus for local reversibility. In: Devitt, S., Lanese, I. (eds.) RC 2016. LNCS, vol. 9720, pp. 20\u201335. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40578-0_2"},{"key":"1_CR103","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.scico.2017.09.008","volume":"151","author":"S Kuhn","year":"2018","unstructured":"Kuhn, S., Ulidowski, I.: Local reversibility in a calculus of covalent bonding. Sci. Comput. Program. 151, 18\u201347 (2018)","journal-title":"Sci. Comput. Program."},{"issue":"1\u20132","key":"1_CR104","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0304-3975(96)00025-4","volume":"174","author":"P Kurka","year":"1997","unstructured":"Kurka, P.: On topological dynamics of Turing machines. Theor. Comput. Sci. 174(1\u20132), 203\u2013216 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR105","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-662-48057-1_3","volume-title":"Mathematical Foundations of Computer Science 2015","author":"M Kutrib","year":"2015","unstructured":"Kutrib, M.: Reversible and irreversible computations of deterministic finite-state devices. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 38\u201352. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48057-1_3"},{"key":"1_CR106","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1016\/j.ic.2008.03.015","volume":"206","author":"M Kutrib","year":"2008","unstructured":"Kutrib, M., Malcher, A.: Fast reversible language recognition using cellular automata. Inf. Comput. 206, 1142\u20131151 (2008)","journal-title":"Inf. Comput."},{"key":"1_CR107","doi-asserted-by":"crossref","first-page":"1814","DOI":"10.1016\/j.jcss.2011.12.004","volume":"78","author":"M Kutrib","year":"2012","unstructured":"Kutrib, M., Malcher, A.: Reversible pushdown automata. J. Comput. Syst. Sci. 78, 1814\u20131827 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR108","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-319-18812-6_5","volume-title":"Cellular Automata and Discrete Complex Systems","author":"M Kutrib","year":"2015","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Real-time reversible one-way cellular automata. In: Isokawa, T., Imai, K., Matsui, N., Peper, F., Umeo, H. (eds.) AUTOMATA 2014. LNCS, vol. 8996, pp. 56\u201369. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18812-6_5"},{"key":"1_CR109","first-page":"341","volume":"148","author":"M Kutrib","year":"2016","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Reversible queue automata. Fund. Inf. 148, 341\u2013368 (2016)","journal-title":"Fund. Inf."},{"key":"1_CR110","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1051\/ita\/2016016","volume":"50","author":"M Kutrib","year":"2016","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: When input-driven pushdown automata meet reversiblity. RAIRO - Theor. Inf. Applic. 50, 313\u2013330 (2016)","journal-title":"RAIRO - Theor. Inf. Applic."},{"key":"1_CR111","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.tcs.2019.06.021","volume":"787","author":"M Kutrib","year":"2019","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Transducing reversibly with finite state machines. Theor. Comput. Sci. 787, 111\u2013126 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR112","first-page":"31","volume":"155","author":"M Kutrib","year":"2017","unstructured":"Kutrib, M., Wendlandt, M.: Reversible limited automata. Fund. Inf. 155, 31\u201358 (2017)","journal-title":"Fund. Inf."},{"key":"1_CR113","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R Landauer","year":"1961","unstructured":"Landauer, R.: Irreversibility and heat generated in the computing process. IBM J. Res. Dev. 5, 183\u2013191 (1961)","journal-title":"IBM J. Res. Dev."},{"key":"1_CR114","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":"1_CR115","doi-asserted-by":"crossref","unstructured":"Lanese, I., Medic, D., Mezzina, C.A.: Static versus dynamic reversibility in CCS. Acta Informatica (2019)","DOI":"10.1007\/s00236-019-00346-6"},{"key":"1_CR116","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":"1_CR117","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":"1_CR118","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-36315-3_19","volume-title":"Reversible Computation","author":"I Lanese","year":"2013","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.-B.: Controlled reversibility and compensations. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 233\u2013240. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36315-3_19"},{"key":"1_CR119","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.tcs.2016.02.019","volume":"625","author":"I Lanese","year":"2016","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.-B.: Reversibility in the higher-order $$\\pi $$-calculus. Theor. Comput. Sci. 625, 25\u201384 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR120","unstructured":"Lanese, I., Mezzina, C.A., Tiezzi, F.: Causal-consistent reversibility. Bull. EATCS 114 (2014)"},{"key":"1_CR121","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-90686-7_16","volume-title":"Functional and Logic Programming","author":"I Lanese","year":"2018","unstructured":"Lanese, I., Nishida, N., Palacios, A., Vidal, G.: CauDEr: a causal-consistent reversible debugger for Erlang. In: Gallagher, J.P., Sulzmann, M. (eds.) FLOPS 2018. LNCS, vol. 10818, pp. 247\u2013263. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90686-7_16"},{"key":"1_CR122","doi-asserted-by":"crossref","unstructured":"Laursen, J.S., Schultz, U.P., Ellekilde, L.: Automatic error recovery in robot assembly operations using reverse execution. In: Intelligent Robots and Systems, IROS 2015, pp. 1785\u20131792. IEEE (2015)","DOI":"10.1109\/IROS.2015.7353609"},{"issue":"1\u20133","key":"1_CR123","first-page":"145","volume":"22","author":"GJ Lavado","year":"2017","unstructured":"Lavado, G.J., Pighizzini, G., Prigioniero, L.: Minimal and reduced reversible automata. J. Automata, Lang. Comb. 22(1\u20133), 145\u2013168 (2017)","journal-title":"J. Automata, Lang. Comb."},{"key":"1_CR124","doi-asserted-by":"crossref","unstructured":"Lavado, G.J., Pighizzini, G., Prigioniero, L.: Weakly and strongly irreversible regular languages. In: Automata and Formal Languages, AFL 2017. EPTCS, vol. 252, pp. 143\u2013156 (2017)","DOI":"10.4204\/EPTCS.252.15"},{"issue":"6\u20137","key":"1_CR125","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1142\/S0129054119400331","volume":"30","author":"GJ Lavado","year":"2019","unstructured":"Lavado, G.J., Prigioniero, L.: Concise representations of reversible automata. Int. J. Found. Comput. Sci. 30(6\u20137), 1157\u20131175 (2019)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"1_CR126","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-30793-5_1","volume-title":"Formal Techniques for Distributed Systems","author":"M Lienhardt","year":"2012","unstructured":"Lienhardt, M., Lanese, I., Mezzina, C.A., Stefani, J.-B.: A reversible abstract machine and its space overhead. In: Giese, H., Rosu, G. (eds.) FMOODS\/FORTE -2012. LNCS, vol. 7273, pp. 1\u201317. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30793-5_1"},{"issue":"2","key":"1_CR127","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1017\/S1446788700005371","volume":"8","author":"K Mahler","year":"1968","unstructured":"Mahler, K.: An unsolved problem on the powers of 3\/2. J. Australian Math. Soc. 8(2), 313\u2013321 (1968)","journal-title":"J. Australian Math. Soc."},{"key":"1_CR128","doi-asserted-by":"crossref","unstructured":"Matsuda, K., Hu, Z., Nakano, K., Hamana, M., Takeichi, M.: Bidirectionalization transformation based on automatic derivation of view complement functions. In: International Conference on Functional Programming, ICFP 2007, pp. 47\u201358. ACM (2007)","DOI":"10.1145\/1291220.1291162"},{"key":"1_CR129","unstructured":"McNellis, J., Mola, J., Sykes, K.: Time travel debugging: root causing bugs in commercial scale software. CppCon talk (2017). https:\/\/www.youtube.com\/watch?v=l1YJTg_A914"},{"key":"1_CR130","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-319-40578-0_3","volume-title":"Reversible Computation","author":"D Medi\u0107","year":"2016","unstructured":"Medi\u0107, D., Mezzina, C.A.: Static VS dynamic reversibility in CCS. In: Devitt, S., Lanese, I. (eds.) RC 2016. LNCS, vol. 9720, pp. 36\u201351. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40578-0_3"},{"key":"1_CR131","doi-asserted-by":"crossref","unstructured":"Medic, D., Mezzina, C.A., Phillips, I., Yoshida, N.: A parametric framework for reversible pi-calculi. In: Workshop on Expressiveness in Concurrency and Workshop on Structural Operational Semantics, EXPRESS\/SOS 2018. EPTCS, vol. 276, pp. 87\u2013103 (2018)","DOI":"10.4204\/EPTCS.276.8"},{"key":"1_CR132","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-030-22397-7_2","volume-title":"Coordination Models and Languages","author":"H Melgratti","year":"2019","unstructured":"Melgratti, H., Mezzina, C.A., Ulidowski, I.: Reversing P\/T Nets. In: Riis Nielson, H., Tuosto, E. (eds.) COORDINATION 2019. LNCS, vol. 11533, pp. 19\u201336. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22397-7_2"},{"key":"1_CR133","series-title":"LNCS","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":"1_CR134","doi-asserted-by":"crossref","unstructured":"Mezzina, C.A., et al.: Software and reversible systems: a survey of recent activities. In: Ulidowski, I., et al. (eds.) Reversible Computation. LNCS 12070, pp. 41\u201359. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-47361-7_2"},{"key":"1_CR135","doi-asserted-by":"crossref","unstructured":"Mezzina, C.A., Koutavas, V.: A safety and liveness theory for total reversibility. In: Theoretical Aspects of Software Engineering, TASE 2017, pp. 1\u20138. IEEE Computer Society (2017)","DOI":"10.1109\/TASE.2017.8285635"},{"key":"1_CR136","doi-asserted-by":"crossref","unstructured":"Mezzina, C.A., P\u00e9rez, J.A.: Reversible sessions using monitors. In: Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software, PLACES 2016. EPTCS, vol. 211, pp. 56\u201364 (2016)","DOI":"10.4204\/EPTCS.211.6"},{"key":"1_CR137","doi-asserted-by":"crossref","unstructured":"Mezzina, C.A., P\u00e9rez, J.A.: Causally consistent reversible choreographies: a monitors-as-memories approach. In: Principles and Practice of Declarative Programming, PPDP 2017, pp. 127\u2013138. ACM (2017)","DOI":"10.1145\/3131851.3131864"},{"key":"1_CR138","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.jlamp.2017.03.003","volume":"90","author":"CA Mezzina","year":"2017","unstructured":"Mezzina, C.A., P\u00e9rez, J.A.: Reversibility in session-based concurrency: a fresh look. J. Log. Algebr. Meth. Program. 90, 2\u201330 (2017)","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"1_CR139","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-030-21571-2_13","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"\u0141 Mikulski","year":"2019","unstructured":"Mikulski, \u0141., Lanese, I.: Reversing unbounded Petri nets. In: Donatelli, S., Haar, S. (eds.) PETRI NETS 2019. LNCS, vol. 11522, pp. 213\u2013233. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21571-2_13"},{"key":"1_CR140","series-title":"LNCS","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3"},{"key":"1_CR141","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-41579-6_16","volume-title":"Perspectives of System Informatics","author":"T\u00c6 Mogensen","year":"2016","unstructured":"Mogensen, T.\u00c6.: RSSA: a reversible SSA form. In: Mazzara, M., Voronkov, A. (eds.) PSI 2015. LNCS, vol. 9609, pp. 203\u2013217. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41579-6_16"},{"issue":"3","key":"1_CR142","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s00354-018-0037-3","volume":"36","author":"T\u00c6 Mogensen","year":"2018","unstructured":"Mogensen, T.\u00c6.: Reversible garbage collection for reversible functional languages. New Gener. Compu. 36(3), 203\u2013232 (2018)","journal-title":"New Gener. Compu."},{"key":"1_CR143","doi-asserted-by":"publisher","DOI":"10.1007\/978-4-431-56606-9","volume-title":"Theory of Reversible Computing. Monographs in Theoretical Computer Science. An EATCS Series","author":"K Morita","year":"2017","unstructured":"Morita, K.: Theory of Reversible Computing. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Tokyo (2017). https:\/\/doi.org\/10.1007\/978-4-431-56606-9"},{"issue":"6","key":"1_CR144","first-page":"758","volume":"E72","author":"K Morita","year":"1989","unstructured":"Morita, K., Harao, M.: Computation universality of one-dimensional reversible (injective) cellular automata. IEICE Trans. E72(6), 758\u2013762 (1989)","journal-title":"IEICE Trans."},{"issue":"1\u20132","key":"1_CR145","first-page":"101","volume":"12","author":"D Morrison","year":"2016","unstructured":"Morrison, D., Ulidowski, I.: Direction-reversible self-timed cellular automata for delay-insensitive circuits. J. Cellular Automata 12(1\u20132), 101\u2013120 (2016)","journal-title":"J. Cellular Automata"},{"issue":"3","key":"1_CR146","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.tcs.2006.12.019","volume":"373","author":"MR Mousavi","year":"2007","unstructured":"Mousavi, M.R., Reniers, M.A., Groote, J.F.: SOS formats and meta-theory: 20 years after. Theor. Comput. Sci. 373(3), 238\u2013272 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"1_CR147","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541\u2013580 (1989)","journal-title":"Proc. IEEE"},{"key":"1_CR148","unstructured":"Nishida, N., Palacios, A., Vidal, G.: Reversible term rewriting. In: Formal Structures for Computation and Deduction, FSCD 2016. LIPIcs, vol. 52. pp. 28:1\u201328:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"1_CR149","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-319-63139-4_15","volume-title":"Logic-Based Program Synthesis and Transformation","author":"N Nishida","year":"2017","unstructured":"Nishida, N., Palacios, A., Vidal, G.: A reversible semantics for Erlang. In: Hermenegildo, M.V., Lopez-Garcia, P. (eds.) LOPSTR 2016. LNCS, vol. 10184, pp. 259\u2013274. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63139-4_15"},{"key":"1_CR150","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.jlamp.2017.10.003","volume":"94","author":"N Nishida","year":"2018","unstructured":"Nishida, N., Palacios, A., Vidal, G.: Reversible computation in term rewriting. J. Log. Algebr. Meth. Program. 94, 128\u2013149 (2018)","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"1_CR151","unstructured":"Nishida, N., Vidal, G.: Program inversion for tail recursive functions. In: Rewriting Techniques and Applications, RTA 2011. LIPIcs, vol. 10, pp. 283\u2013298. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2011)"},{"key":"1_CR152","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-21500-2_5","volume-title":"Reversible Computation","author":"N Nishida","year":"2019","unstructured":"Nishida, N., Vidal, G.: Characterizing compatible view updates in syntactic bidirectionalization. In: Thomsen, M.K., Soeken, M. (eds.) RC 2019. LNCS, vol. 11497, pp. 67\u201383. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21500-2_5"},{"key":"1_CR153","unstructured":"Paolini, L., Piccolo, M., Roversi, L.: A certified study of a reversible programming language. In: Types for Proofs and Programs, TYPES 2018. LIPIcs, vol. 69, pp. 7:1\u20137:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"issue":"1","key":"1_CR154","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"G P\u0103un","year":"2000","unstructured":"P\u0103un, G.: Computing with membranes. J. Comput. Syst. Sci. 61(1), 108\u2013143 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR155","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":"1_CR156","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-030-21500-2_15","volume-title":"Reversible Computation","author":"A Philippou","year":"2019","unstructured":"Philippou, A., Psara, K., Siljak, H.: Controlling reversibility in reversing Petri nets with application to wireless communications. In: Thomsen, M.K., Soeken, M. (eds.) RC 2019. LNCS, vol. 11497, pp. 238\u2013245. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21500-2_15"},{"issue":"6","key":"1_CR157","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1016\/j.jlamp.2015.07.004","volume":"84","author":"I Phillips","year":"2015","unstructured":"Phillips, I., Ulidowski, I.: Reversibility and asymmetric conflict in event structures. J. Log. Algebr. Meth. Program. 84(6), 781\u2013805 (2015)","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"1_CR158","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":"1_CR159","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-38986-3_12","volume-title":"Reversible Computation","author":"I Phillips","year":"2013","unstructured":"Phillips, I., Ulidowski, I., Yuen, S.: Modelling of bonding with processes and events. In: Dueck, G.W., Miller, D.M. (eds.) RC 2013. LNCS, vol. 7948, pp. 141\u2013154. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38986-3_12"},{"key":"1_CR160","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"},{"issue":"1\u20132","key":"1_CR161","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.jlap.2006.11.002","volume":"73","author":"ICC Phillips","year":"2007","unstructured":"Phillips, I.C.C., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebr. Program. 73(1\u20132), 70\u201396 (2007)","journal-title":"J. Log. Algebr. Program."},{"key":"1_CR162","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BFb0023844","volume-title":"LATIN \u201992","author":"J-E Pin","year":"1992","unstructured":"Pin, J.-E.: On reversible automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 401\u2013416. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0023844"},{"key":"1_CR163","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-73359-3_16","volume-title":"Membrane Computing","author":"GM Pinna","year":"2018","unstructured":"Pinna, G.M.: Reversing steps in membrane systems computations. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) CMC 2017. LNCS, vol. 10725, pp. 245\u2013261. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73359-3_16"},{"key":"1_CR164","doi-asserted-by":"crossref","first-page":"130503","DOI":"10.1103\/PhysRevLett.113.130503","volume":"113","author":"P Rebentrost","year":"2014","unstructured":"Rebentrost, P., Mohseni, M., Lloyd, S.: Quantum support vector machine for big data classification. Phys. Rev. Lett. 113, 130503 (2014)","journal-title":"Phys. Rev. Lett."},{"key":"1_CR165","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science","author":"W Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science, vol. 4. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/978-3-642-69968-9"},{"issue":"2","key":"1_CR166","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.ic.2006.06.002","volume":"205","author":"A Rensink","year":"2007","unstructured":"Rensink, A., Vogler, W.: Fair testing. Inf. Comput. 205(2), 125\u2013198 (2007)","journal-title":"Inf. Comput."},{"key":"1_CR167","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-319-89366-2_19","volume-title":"Foundations of Software Science and Computation Structures","author":"A Sabry","year":"2018","unstructured":"Sabry, A., Valiron, B., Vizzotto, J.K.: From symmetric pattern-matching to quantum control. In: Baier, C., Dal Lago, U. (eds.) FoSSaCS 2018. LNCS, vol. 10803, pp. 348\u2013364. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89366-2_19"},{"key":"1_CR168","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-662-47221-7_3","volume-title":"Cellular Automata and Discrete Complex Systems","author":"V Salo","year":"2015","unstructured":"Salo, V.: Groups and monoids of cellular automata. In: Kari, J. (ed.) AUTOMATA 2015. LNCS, vol. 9099, pp. 17\u201345. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47221-7_3"},{"key":"1_CR169","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-319-58741-7_35","volume-title":"Unveiling Dynamics and Complexity","author":"V Salo","year":"2017","unstructured":"Salo, V., T\u00f6rm\u00e4, I.: A one-dimensional physically universal cellular automaton. In: Kari, J., Manea, F., Petre, I. (eds.) CiE 2017. LNCS, vol. 10307, pp. 375\u2013386. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58741-7_35"},{"key":"1_CR170","doi-asserted-by":"crossref","unstructured":"Schaeffer, L.: A physically universal cellular automaton. In: Innovations in Theoretical Computer Science, ITCS 2015, pp. 237\u2013246. ACM (2015)","DOI":"10.1145\/2688073.2688107"},{"issue":"3","key":"1_CR171","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s00354-018-0038-2","volume":"36","author":"M Schordan","year":"2018","unstructured":"Schordan, M., Oppelstrup, T., Jefferson, D., Barnes Jr., P.D.: Generation of reversible C++ code for optimistic parallel discrete event simulation. New Gener. Comput. 36(3), 257\u2013280 (2018)","journal-title":"New Gener. Comput."},{"key":"1_CR172","doi-asserted-by":"crossref","unstructured":"Schordan, M., Oppelstrup, T., Thomsen, M.K., Gl\u00fcck, R.: Reversible languages and incremental state saving in optimistic parallel discrete event simulation. In: Ulidowski, I., et al. (eds.) Reversible Computation. LNCS 12070, pp. 187\u2013207. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-47361-7_9"},{"key":"1_CR173","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-319-40578-0_10","volume-title":"Reversible Computation","author":"UP Schultz","year":"2016","unstructured":"Schultz, U.P., Axelsen, H.B.: Elements of a reversible object-oriented language. In: Devitt, S., Lanese, I. (eds.) RC 2016. LNCS, vol. 9720, pp. 153\u2013159. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40578-0_10"},{"key":"1_CR174","doi-asserted-by":"crossref","unstructured":"Selinger, P.: Dagger compact closed categories and completely positive maps. In: Workshop on Quantum Programming Languages, QPL 2005. Electronic Notes in Theoretical Computer Science, vol. 170, pp. 139\u2013163 (2005)","DOI":"10.1016\/j.entcs.2006.12.018"},{"key":"1_CR175","series-title":"Lecture Notes in Physics","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-12821-9_4","volume-title":"New Structures for Physics","author":"P Selinger","year":"2011","unstructured":"Selinger, P.: A survey of graphical languages for monoidal categories. New Structures for Physics. Lecture Notes in Physics, vol. 813, pp. 289\u2013355. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-12821-9_4"},{"issue":"4","key":"1_CR176","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1145\/321850.321859","volume":"21","author":"JR Slagle","year":"1974","unstructured":"Slagle, J.R.: Automated theorem-proving for theories with simplifiers, commutativity and associativity. J. ACM 21(4), 622\u2013642 (1974)","journal-title":"J. ACM"},{"issue":"1","key":"1_CR177","first-page":"19","volume":"5","author":"K Sutner","year":"1991","unstructured":"Sutner, K.: De Bruijn graphs and linear cellular automata. Complex Syst. 5(1), 19\u201330 (1991)","journal-title":"Complex Syst."},{"key":"1_CR178","unstructured":"Terese: Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press (2003)"},{"issue":"5","key":"1_CR179","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1016\/j.jlamp.2015.03.004","volume":"84","author":"F Tiezzi","year":"2015","unstructured":"Tiezzi, F., Yoshida, N.: Reversible session-based pi-calculus. J. Log. Algebr. Meth. Program. 84(5), 684\u2013707 (2015)","journal-title":"J. Log. Algebr. Meth. Program."},{"issue":"2","key":"1_CR180","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(77)80007-X","volume":"15","author":"T Toffoli","year":"1977","unstructured":"Toffoli, T.: Computation and construction universality of reversible cellular automata. J. Comput. Syst. Sci. 15(2), 213\u2013231 (1977)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR181","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1763.001.0001","volume-title":"Cellular Automata Machines: A New Environment for Modeling","author":"T Toffoli","year":"1987","unstructured":"Toffoli, T., Margolus, N.: Cellular Automata Machines: A New Environment for Modeling. MIT Press, Cambridge (1987)"},{"issue":"8","key":"1_CR182","doi-asserted-by":"crossref","first-page":"1840003","DOI":"10.1142\/S0219749918400038","volume":"16","author":"D Windridge","year":"2018","unstructured":"Windridge, D., Mengoni, R., Nagarajan, R.: Quantum error-correcting output codes. Int. J. Quantum Inf. 16(8), 1840003 (2018)","journal-title":"Int. J. Quantum Inf."},{"key":"1_CR183","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-52289-0_9","volume-title":"Quantum Interaction","author":"D Windridge","year":"2017","unstructured":"Windridge, D., Nagarajan, R.: Quantum bootstrap aggregation. In: de Barros, J.A., Coecke, B., Pothos, E. (eds.) QI 2016. LNCS, vol. 10106, pp. 115\u2013121. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52289-0_9"},{"key":"1_CR184","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-29517-1_2","volume-title":"Reversible Computation","author":"T Yokoyama","year":"2012","unstructured":"Yokoyama, T., Axelsen, H.B., Gl\u00fcck, R.: Towards a reversible functional language. In: De Vos, A., Wille, R. (eds.) RC 2011. LNCS, vol. 7165, pp. 14\u201329. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29517-1_2"},{"key":"1_CR185","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.tcs.2015.07.046","volume":"611","author":"T Yokoyama","year":"2016","unstructured":"Yokoyama, T., Axelsen, H.B., Gl\u00fcck, R.: Fundamentals of reversible flowchart languages. Theoret. Comput. Sci. 611, 87\u2013115 (2016)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Reversible Computation: Extending Horizons of Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-47361-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T20:04:54Z","timestamp":1722888294000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-47361-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030473600","9783030473617"],"references-count":186,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-47361-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"12 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}