S. Abramsky, Retracing some paths in process algebra, CONCUR '96: Concurrency Theory, vol.1119, pp.1-17, 1996.

S. Abramsky, A structural approach to reversible computation, Theoretical Computer Science, vol.347, issue.3, pp.441-464, 2005.

S. Abramsky and B. Coecke, A categorical semantics of quantum protocols, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.415-425, 2004.

S. Abramsky, E. Haghverdi, and P. Scott, Geometry of Interaction and linear combinatory algebras, Mathematical Structures in Computer Science, vol.12, issue.5, pp.625-665, 2002.

O. Agrigoroaiei, G. Ciobanu, D. W. Corne, P. Frisco, G. P?un et al., Membrane Computing, WMC 2008, vol.5391, pp.95-107, 2009.

O. Agrigoroaiei and G. Ciobanu, Dual P Systems, Membrane Computing, pp.95-107, 2009.

O. Agrigoroaiei and G. Ciobanu, Reversing computation in membrane systems, The Journal of Logic and Algebraic Programming, vol.79, issue.3-5, pp.278-288, 2010.

B. Aman and G. Ciobanu, Mutual exclusion and reversibility in reaction systems, Journal of Membrane Computing, vol.2, issue.3, pp.171-178, 2020.

B. Aman and G. Ciobanu, Controlled Reversibility in Reaction Systems, Membrane Computing, vol.10725, pp.40-53, 2017.

D. Angluin, Inference of Reversible Languages, Journal of the ACM, vol.29, issue.3, pp.741-765, 1982.

E. Ardeshir-larijani, S. J. Gay, and R. Nagarajan, Automated Equivalence Checking of Concurrent Quantum Systems, ACM Transactions on Computational Logic, vol.19, issue.4, pp.1-32, 2018.

H. B. Axelsen and R. Glück, Reversible Representation and Manipulation of Constructor Terms in the Heap, Reversible Computation, vol.7948, pp.96-109, 2013.

H. B. Axelsen and R. Glück, On reversible Turing machines and their function universality, Acta Informatica, vol.53, issue.5, pp.509-543, 2016.

H. B. Axelsen, M. Holzer, and M. Kutrib, The Degree of Irreversibility in Deterministic Finite Automata, International Journal of Foundations of Computer Science, vol.28, issue.05, pp.503-522, 2017.

H. B. Axelsen, M. Holzer, M. Kutrib, and A. Malcher, Reversible Shrinking Two-Pushdown Automata, Language and Automata Theory and Applications, vol.9618, pp.579-591, 2016.

H. B. Axelsen, S. Jakobi, M. Kutrib, and A. Malcher, A Hierarchy of Fast Reversible Turing Machines, Reversible Computation, vol.9138, pp.29-44, 2015.

H. B. Axelsen, M. Kutrib, A. Malcher, and M. Wendlandt, Boosting Reversible Pushdown Machines by Preprocessing, Reversible Computation, vol.9720, pp.89-104, 2016.

F. Baader and T. Nipkow, Term Rewriting and All That, Term Rewriting and All That, 1998.

G. Bacci, V. Danos, and O. Kammar, On the Statistical Thermodynamics of Reversible Communicating Processes, Algebra and Coalgebra in Computer Science, vol.6859, pp.1-18, 2011.

E. Badouel, L. Bernardinello, and P. Darondeau, Petri Net Synthesis, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01237142

F. Barbanera and U. De?-liguoro, A Game Interpretation of Retractable Contracts, Lecture Notes in Computer Science, vol.9686, pp.18-34, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01631714

F. Barbanera, M. Dezani-ciancaglini, and U. De'-liguoro, Compliance for reversible client/server interactions, Electronic Proceedings in Theoretical Computer Science, vol.162, pp.35-42, 2014.

F. Barbanera, M. Dezani-ciancaglini, and U. De?liguoro, Reversible client/server interactions, Formal Aspects of Computing, vol.28, issue.4, pp.697-722, 2016.

F. Barbanera, M. Dezani-ciancaglini, I. Lanese, and U. De'liguoro, Retractable Contracts, Electronic Proceedings in Theoretical Computer Science, vol.203, pp.61-72, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01227693

F. Barbanera, I. Lanese, and U. De?liguoro, Retractable and Speculative Contracts, Lecture Notes in Computer Science, vol.10319, pp.119-137, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01633262

S. Barbieri, J. Kari, and V. Salo, The Group of Reversible Turing Machines, Cellular Automata and Discrete Complex Systems, vol.9664, pp.49-62, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01435034

K. Barylska, E. Erofeev, M. Koutny, ?. Mikulski, and M. Pi?tkowski, Reversing Transitions in Bounded Petri Nets, Fundamenta Informaticae, vol.157, issue.4, pp.341-357, 2018.

K. Barylska, A. Gogoli?ska, L. Mikulski, A. Philippou, M. Pi-atkowski et al., Reversing computations modelled by coloured Petri nets, Workshop on Algorithms & Theories for the Analysis of Event Data. CEUR Workshop Proceedings, vol.2115, pp.91-111, 2018.

K. Barylska, M. Koutny, ?. Mikulski, and M. Pi?tkowski, Reversible computation vs. reversibility in Petri nets, Science of Computer Programming, vol.151, pp.48-60, 2018.

C. H. Bennett and G. Brassard, Quantum cryptography: Public key distribution and coin tossing, Theoretical Computer Science, vol.560, pp.7-11, 2014.

G. Berry and G. Boudol, The chemical abstract machine, Theoretical Computer Science, vol.96, issue.1, pp.217-248, 1992.
URL : https://hal.archives-ouvertes.fr/inria-00075426

J. Berstel, Context-Free Languages, Transductions and Context-Free Languages, pp.22-50, 1979.
URL : https://hal.archives-ouvertes.fr/hal-00620760

J. Boender, F. Kammüller, and R. Nagarajan, Formalization of Quantum Protocols using Coq, Electronic Proceedings in Theoretical Computer Science, vol.195, pp.71-83, 2015.

Z. Bouziane and A. Finkel, Cyclic Petri Net Reachability Sets are Semi-linear Effectively Constructible, Electronic Notes in Theoretical Computer Science, vol.9, pp.15-24, 1997.

W. J. Bowman, R. P. James, and A. Sabry, Dagger traced symmetric monoidal categories and reversible programming, Reversible Computation, RC 2011, pp.51-56, 2011.

L. Cardelli and C. Laneve, Reversible structures, Proceedings of the 9th International Conference on Computational Methods in Systems Biology - CMSB '11, vol.21, pp.175-198, 2011.

L. Cardelli and C. Laneve, Reversible structures, Proceedings of the 9th International Conference on Computational Methods in Systems Biology - CMSB '11, pp.131-140, 2011.

C. D. Carothers, K. S. Perumalla, and R. M. Fujimoto, Efficient optimistic parallel simulations using reverse computation, ACM Transactions on Modeling and Computer Simulation, vol.9, issue.3, pp.224-253, 1999.

J. Cassaigne, N. Ollinger, and R. Torres-avilés, A small minimal aperiodic reversible Turing machine, Journal of Computer and System Sciences, vol.84, pp.288-301, 2017.
URL : https://hal.archives-ouvertes.fr/hal-00975244

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Mart??-oliet et al., Maude: specification and programming in rewriting logic, Theoretical Computer Science, vol.285, issue.2, pp.187-243, 2002.

J. R. Cockett and S. Lack, Restriction categories I: categories of partial maps, Theoretical Computer Science, vol.270, issue.1-2, pp.223-259, 2002.

M. Colange, S. Baarir, F. Kordon, and Y. Thierry-mieg, Crocodile: A Symbolic/Symbolic Tool for the Analysis of Symmetric Nets with Bag, Applications and Theory of Petri Nets, vol.6709, pp.338-347, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01282493

M. Colange, S. Baarir, F. Kordon, and Y. Thierry-mieg, Crocodile: A Symbolic/Symbolic Tool for the Analysis of Symmetric Nets with Bag, Applications and Theory of Petri Nets, pp.338-347, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01282493

I. Cristescu, J. Krivine, and D. Varacca, A Compositional Semantics for the Reversible p-Calculus, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.388-397, 2013.

M. H. Cservenka, R. Glück, T. Haulund, and T. Æ. Mogensen, Data Structures and Dynamic Memory Management in Reversible Languages, Reversible Computation, vol.11106, pp.269-285, 2018.

V. Danos and J. Krivine, Reversible Communicating Systems, CONCUR 2004 - Concurrency Theory, vol.3170, pp.292-307, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00784051

V. Danos and J. Krivine, Transactions in RCCS, Lecture Notes in Computer Science, vol.3653, pp.398-412, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00164585

V. Danos and J. Krivine, Formal Molecular Biology Done in CCS-R, Electronic Notes in Theoretical Computer Science, vol.180, issue.3, pp.31-49, 2007.

K. H. Rose, Higher-order Rewriting for Executable Compiler Specifications, Electronic Proceedings in Theoretical Computer Science, vol.49, pp.31-45, 2011.

L. Dartois, P. Fournier, I. Jecker, and N. Lhote, Dagstuhl Manifesto, Informatik-Spektrum, vol.40, issue.1, pp.113-125, 2017.

D. De-frutos-escrig, M. Koutny, and ?. Mikulski, An Efficient Characterization of Petri Net Solvable Binary Words, Application and Theory of Petri Nets and Concurrency, vol.10877, pp.207-226, 2018.

D. De-frutos-escrig, M. Koutny, and ?. Mikulski, Reversing Steps in Petri Nets, Application and Theory of Petri Nets and Concurrency, vol.11522, pp.171-191, 2019.

D. De-frutos-escrig, M. Koutny, and ?. Mikulski, Reversing Steps in Petri Nets, Application and Theory of Petri Nets and Concurrency, pp.171-191, 2019.

R. De-nicola and M. C. Hennessy, Testing equivalences for processes, Theoretical Computer Science, vol.34, issue.1-2, pp.83-133, 1984.

M. Delacourt and N. Ollinger, Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups, Unveiling Dynamics and Complexity, vol.10307, pp.234-245, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01436460

A. Di-pierro, R. Mengoni, R. Nagarajan, and D. Windridge, Hamming Distance Kernelisation via Topological Quantum Computation, Theory and Practice of Natural Computing, vol.10687, pp.269-280, 2017.

A. Di-pierro, R. Mengoni, R. Nagarajan, and D. Windridge, Hamming Distance Kernelisation via Topological Quantum Computation, Theory and Practice of Natural Computing, pp.269-280, 2017.

A. Ehrenfeucht and G. Rozenberg, SQUARE SYSTEMS, Fundamenta Informaticae, vol.20, issue.1,2,3, pp.75-111, 1994.

J. Esparza and M. Nielsen, Decidability Issues for Petri Nets, BRICS Report Series, vol.1, issue.8, 1994.

N. Foster, K. Matsuda, and J. Voigtländer, Three Complementary Approaches to Bidirectional Programming, Lecture Notes in Computer Science, vol.7470, pp.1-46, 2012.

E. Giachino, I. Lanese, C. A. Mezzina, and F. Tiezzi, Causal-Consistent Reversibility in a Tuple-Based Language, 2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, pp.467-475, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01227615

E. Giachino, I. Lanese, C. A. Mezzina, and F. Tiezzi, Causal-consistent rollback in a tuple-based language, Journal of Logical and Algebraic Methods in Programming, vol.88, pp.99-120, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01633260

B. G. Giles, An investigation of some theoretical aspects of reversible computing, 2014.

R. Glück and R. Kaarsgaard, A Categorical Foundation for Structured Reversible Flowchart Languages, Electronic Notes in Theoretical Computer Science, vol.336, pp.155-171, 2018.

R. Glück and R. Kaarsgaard, A Categorical Foundation for Structured Reversible Flowchart Languages, Electronic Notes in Theoretical Computer Science, vol.336, issue.3, pp.155-171, 2018.

R. Glück, R. Kaarsgaard, and T. Yokoyama, Reversible Programs Have Reversible Semantics, Lecture Notes in Computer Science, pp.413-427, 2020.

R. Glück and T. Yokoyama, A linear-time self-interpreter of a reversible imperative language, Comput. Soft, vol.33, issue.3, pp.108-128, 2016.

R. Glück and T. Yokoyama, A Minimalist's Reversible While Language, IEICE Transactions on Information and Systems, vol.E100.D, issue.5, pp.1026-1034, 2017.

R. Glück and T. Yokoyama, Constructing a binary tree from its traversals by reversible recursion and iteration, Information Processing Letters, vol.147, pp.32-37, 2019.

E. Graversen, I. Phillips, and N. Yoshida, Towards a categorical representation of reversible event structures, Journal of Logical and Algebraic Methods in Programming, vol.104, pp.16-59, 2019.

B. Guillon, M. Kutrib, A. Malcher, and L. Prigioniero, Reversible Pushdown Transducers, Developments in Language Theory, vol.11088, pp.354-365, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02079113

B. Guillon, M. Kutrib, A. Malcher, and L. Prigioniero, Reversible Pushdown Transducers, Developments in Language Theory, pp.354-365, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02079113

X. Guo, Thesis Abstracts. Maxwell L. Foran. "The Civic Corporation and Urban Growth: Calgary, 1884-1930." Ph.D. Thesis, Department of History, University of Calgary, 1981 Eleanor A. Bartlett. "Real Wages and the Standard of Living in Vancouver, 1901-1929." M.A. Thesis, Department of History, University of British Columbia, 1980 Andrea B. Smith. "The Origins of the NPA: A Study in Vancouver Politics, 1930-1940." M.A. Thesis, Department of History, University of British Columbia, 1981 Bryan P. Melynk. "Calgary Buildings, 1904-1914: The Emergence of an Urban Landscape." M.A. Thesis, Department of History, University of Calgary, 1981 S. Langin. "Resource Development and New Towns: A Women's Perspective." M.A. Thesis, School of Community and Regional Planning, University of British Columbia, 1981, Urban History Review, vol.10, issue.3, p.80, 1982.

T. Haulund, T. Æ. Mogensen, and R. Glück, Implementing Reversible Object-Oriented Language Features on Reversible Machines, Reversible Computation, vol.10301, pp.66-73, 2017.

G. A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Mathematical Systems Theory, vol.3, issue.4, pp.320-375, 1969.

C. Heunen, R. Kaarsgaard, and M. Karvonen, Reversible Effects as Inverse Arrows, Electronic Notes in Theoretical Computer Science, vol.341, pp.179-199, 2018.

C. Heunen and B. Jacobs, Quantum Logic in Dagger Kernel Categories, Order, vol.27, issue.2, pp.177-212, 2010.

J. Hoey, I. Ulidowski, and S. Yuen, Reversing Parallel Programs with Blocks and Procedures, Electronic Proceedings in Theoretical Computer Science, vol.276, pp.69-86, 2018.

M. Holzer, S. Jakobi, and M. Kutrib, Minimal Reversible Deterministic Finite Automata, International Journal of Foundations of Computer Science, vol.29, issue.02, pp.251-270, 2018.

M. Holzer and M. Kutrib, Reversible Nondeterministic Finite Automata, Reversible Computation, vol.10301, pp.35-51, 2017.

Z. Hu, A. Schurr, P. Stevens, and J. F. Terwilliger, Dagstuhl seminar on bidirectional transformations (BX), ACM SIGMOD Record, vol.40, issue.1, pp.35-39, 2011.

J. Hullot, Canonical forms and unification, 5th Conference on Automated Deduction Les Arcs, France, July 8?11, 1980, vol.87, pp.318-334, 1980.

H. Hüttel, I. Lanese, V. T. Vasconcelos, L. Caires, M. Carbone et al., Foundations of Session Types and Behavioural Contracts, ACM Computing Surveys, vol.49, issue.1, pp.1-36, 2016.

H. Siljak, Reversible Computation in Wireless Communications, Reversible Computation: Extending Horizons of Computing, pp.208-221, 2020.

B. Jacobs, New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic, Logical Methods in Computer Science, vol.11, issue.3, pp.1-76, 2015.

P. A. Jacobsen, R. Kaarsgaard, and M. K. Thomsen, $$\mathsf {CoreFun}$$: A Typed Functional Reversible Core Language, Reversible Computation, vol.11106, pp.304-321, 2018.

J. Jalonen and J. Kari, Conjugacy of One-Dimensional One-Sided Cellular Automata is Undecidable, SOFSEM 2018: Theory and Practice of Computer Science, vol.10706, pp.227-238, 2017.

R. P. James and A. Sabry, Theseus: a high level language for reversible computing, Work-in-Progress Report Presented at RC 2014

R. P. James and A. Sabry, Information effects, ACM SIGPLAN Notices, vol.47, issue.1, pp.73-84, 2012.

N. D. Jones, Computability and Complexity, 1997.

A. Joyal, R. Street, and D. Verity, Traced monoidal categories, Mathematical Proceedings of the Cambridge Philosophical Society, vol.119, issue.3, pp.447-468, 1996.

R. Kaarsgaard, H. B. Axelsen, and R. Glück, Join inverse categories and reversible recursion, Journal of Logical and Algebraic Methods in Programming, vol.87, pp.33-50, 2017.

R. Kaarsgaard and R. Glück, A categorical foundation for structured reversible flowchart languages: soundness and adequacy, Logical Methods Comput. Sci, vol.14, issue.3, pp.1-38, 2018.

J. Kari, Reversibility of 2D cellular automata is undecidable, Physica D: Nonlinear Phenomena, vol.45, issue.1-3, pp.379-385, 1990.

J. Kari, Universal pattern generation by cellular automata, Theoretical Computer Science, vol.429, pp.180-184, 2012.

J. Kari, Reversible Cellular Automata: From Fundamental Classical Results to Recent Developments, New Generation Computing, vol.36, issue.3, pp.145-172, 2018.

J. Kari and J. Kopra, Cellular automata and powers ofp?q, RAIRO - Theoretical Informatics and Applications, vol.51, issue.4, pp.191-204, 2017.

J. Kari and N. Ollinger, Periodicity and Immortality in Reversible Computing, Lecture Notes in Computer Science, vol.5162, pp.419-430
URL : https://hal.archives-ouvertes.fr/hal-00270815

J. Kari and N. Ollinger, Periodicity and Immortality in Reversible Computing, Lecture Notes in Computer Science, pp.419-430
URL : https://hal.archives-ouvertes.fr/hal-00270815

J. Kari, V. Salo, and T. Worsch, Sequentializing Cellular Automata, Cellular Automata and Discrete Complex Systems, vol.10875, pp.72-87, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01824875

M. Karvonen, The way of the dagger, 2019.

J. Kastl, 2 INVERSE MATRIZEN, Lineare Modelle, vol.7, pp.81-141, 1994.

M. Kawabe and R. Glück, The Program Inverter LRinv and Its Structure, Practical Aspects of Declarative Languages, vol.3350, pp.219-234, 2005.

M. Kawabe and R. Glück, The Program Inverter LRinv and Its Structure, Practical Aspects of Declarative Languages, pp.219-234, 2005.

R. Keller, Towards a Theory of Universal Speed-Independent Modules, IEEE Transactions on Computers, vol.C-23, issue.1, pp.21-33, 1974.

J. W. Klop, Handbook of Logic in Computer Science: Volume 5. Algebraic and Logical Structures, Handbook of Logic in Computer Science, vol.I, pp.1-112, 2001.

K. C. Knowlton, A fast storage allocator, Communications of the ACM, vol.8, issue.10, pp.623-624, 1965.

J. Kopra, Glider Automorphisms on Some Shifts of Finite Type and a Finitary Ryan?s Theorem, Cellular Automata and Discrete Complex Systems, vol.10875, pp.88-99, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01824877

J. Krivine, A Verification Technique for Reversible Process Algebra, Reversible Computation, vol.7581, pp.204-217, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00697549

S. Kuhn and I. Ulidowski, A Calculus for Local Reversibility, Reversible Computation, vol.9720, pp.20-35, 2016.

S. Kuhn and I. Ulidowski, Local reversibility in a Calculus of Covalent Bonding, Science of Computer Programming, vol.151, pp.18-47, 2018.

P. Kurka, On topological dynamics of Turing machines, Theoretical Computer Science, vol.174, issue.1-2, pp.203-216, 1997.

M. Kutrib, Reversible and Irreversible Computations of Deterministic Finite-State Devices, Mathematical Foundations of Computer Science 2015, vol.9234, pp.38-52, 2015.

M. Kutrib and A. Malcher, Fast reversible language recognition using cellular automata, Information and Computation, vol.206, issue.9-10, pp.1142-1151, 2008.

M. Kutrib and A. Malcher, Reversible pushdown automata, Journal of Computer and System Sciences, vol.78, issue.6, pp.1814-1827, 2012.

M. Kutrib, A. Malcher, and M. Wendlandt, Real-Time Reversible One-Way Cellular Automata, Cellular Automata and Discrete Complex Systems, vol.8996, pp.56-69, 2015.

M. Kutrib, A. Malcher, and M. Wendlandt, Reversible Queue Automata, Fundamenta Informaticae, vol.148, issue.3-4, pp.341-368, 2016.

M. Kutrib, A. Malcher, and M. Wendlandt, When input-driven pushdown automata meet reversiblity, RAIRO - Theoretical Informatics and Applications, vol.50, issue.4, pp.313-330, 2016.

M. Kutrib, A. Malcher, and M. Wendlandt, Transducing reversibly with finite state machines, Theoretical Computer Science, vol.787, pp.111-126, 2019.

M. Kutrib and M. Wendlandt, Reversible Limited Automata, Fundamenta Informaticae, vol.155, issue.1-2, pp.31-58, 2017.

R. Landauer, Irreversibility and Heat Generation in the Computing Process, IBM Journal of Research and Development, vol.5, issue.3, pp.183-191, 1961.

I. Lanese, M. Lienhardt, C. A. Mezzina, A. Schmitt, and J. Stefani, Concurrent Flexible Reversibility, Programming Languages and Systems, vol.7792, pp.370-390, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00811629

I. Lanese, D. Medi?, and C. A. Mezzina, Static versus dynamic reversibility in CCS, Acta Informatica, 2019.

I. Lanese, C. A. Mezzina, A. Schmitt, and J. Stefani, Controlling Reversibility in Higher-Order Pi, CONCUR 2011 ? Concurrency Theory, vol.6901, pp.297-311, 2011.

I. Lanese, C. A. Mezzina, and J. Stefani, Reversing Higher-Order Pi, CONCUR 2010 - Concurrency Theory, vol.6269, pp.478-493, 2010.

I. Lanese, C. A. Mezzina, and J. Stefani, Controlled Reversibility and Compensations, Reversible Computation, vol.7581, pp.233-240, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00909377

I. Lanese, C. A. Mezzina, and J. Stefani, Controlled Reversibility and Compensations, Reversible Computation, pp.233-240, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00909377

I. Lanese, C. A. Mezzina, and J. Stefani, Reversibility in the higher-order ?-calculus, Theoretical Computer Science, vol.625, pp.25-84, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01081714

I. Lanese, C. A. Mezzina, and F. Tiezzi, Causal-consistent reversibility, Bull. EATCS, vol.114, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01089350

I. Lanese, N. Nishida, A. Palacios, and G. Vidal, CauDEr: A Causal-Consistent Reversible Debugger for Erlang, Functional and Logic Programming, vol.10818, pp.247-263, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01912894

J. S. Laursen, U. P. Schultz, and L. Ellekilde, Automatic error recovery in robot assembly operations using reverse execution, 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp.1785-1792, 2015.

G. J. Lavado, G. Pighizzini, and L. Prigioniero, Minimal and Reduced Reversible Automata, Descriptional Complexity of Formal Systems, vol.22, pp.168-179, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01633945

G. J. Lavado, G. Pighizzini, and L. Prigioniero, Weakly and Strongly Irreversible Regular Languages, Electronic Proceedings in Theoretical Computer Science, vol.252, pp.143-156, 2017.

G. J. Lavado and L. Prigioniero, Concise Representations of Reversible Automata, International Journal of Foundations of Computer Science, vol.30, issue.06n07, pp.1157-1175, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01657009

M. Lienhardt, I. Lanese, C. A. Mezzina, and J. Stefani, A Reversible Abstract Machine and Its Space Overhead, Formal Techniques for Distributed Systems, vol.7273, pp.1-17, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00909384

K. Mahler, An unsolved problem on the powers of 3/2, Journal of the Australian Mathematical Society, vol.8, issue.2, pp.313-321, 1968.

K. Matsuda, Z. Hu, K. Nakano, M. Hamana, and M. Takeichi, Bidirectionalization transformation based on automatic derivation of view complement functions, Proceedings of the 2007 ACM SIGPLAN international conference on Functional programming - ICFP '07, pp.47-58, 2007.

J. Mcnellis, J. Mola, and K. Sykes, LAS VEGAS SANDS CORP., a Nevada corporation, Plaintiff, v. UKNOWN REGISTRANTS OF www.wn0000.com, www.wn1111.com, www.wn2222.com, www.wn3333.com, www.wn4444.com, www.wn5555.com, www.wn6666.com, www.wn7777.com, www.wn8888.com, www.wn9999.com, www.112211.com, www.4456888.com, www.4489888.com, www.001148.com, and www.2289888.com, Defendants., Gaming Law Review and Economics, vol.20, issue.10, pp.859-868, 2016.

D. Medi? and C. A. Mezzina, Static VS Dynamic Reversibility in CCS, Reversible Computation, vol.9720, pp.36-51, 2016.

D. Medic, C. A. Mezzina, I. Phillips, and N. Yoshida, A Parametric Framework for Reversible Pi-Calculi, Electronic Proceedings in Theoretical Computer Science, vol.276, pp.87-103, 2018.

H. Melgratti, C. A. Mezzina, and I. Ulidowski, Reversing P/T Nets, Lecture Notes in Computer Science, vol.11533, pp.19-36, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02365503

H. Melgratti, C. A. Mezzina, and I. Ulidowski, Reversing P/T Nets, Lecture Notes in Computer Science, pp.19-36, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02365503

C. A. Mezzina, On Reversibility and Broadcast, Reversible Computation, vol.11106, pp.67-83, 2018.

C. A. Mezzina, R. Schlatte, R. Glück, T. Haulund, J. Hoey et al., Software and Reversible Systems: A Survey of Recent Activities, Reversible Computation: Extending Horizons of Computing, vol.12070, pp.41-59, 2020.
URL : https://hal.archives-ouvertes.fr/hal-03005386

C. A. Mezzina and V. Koutavas, A safety and liveness theory for total reversibility, 2017 International Symposium on Theoretical Aspects of Software Engineering (TASE), pp.1-8, 2017.

C. A. Mezzina and J. A. Pérez, Reversible Sessions Using Monitors, Electronic Proceedings in Theoretical Computer Science, vol.211, pp.56-64, 2016.

C. A. Mezzina and J. A. Pérez, Causally consistent reversible choreographies, Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, pp.127-138, 2017.

C. A. Mezzina and J. A. Pérez, Reversibility in session-based concurrency: A fresh look, Journal of Logical and Algebraic Methods in Programming, vol.90, pp.2-30, 2017.

?. Mikulski and I. Lanese, Reversing Unbounded Petri Nets, Application and Theory of Petri Nets and Concurrency, vol.11522, pp.213-233, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02376158

R. Milner, A Calculus of Communicating Systems, LNCS, vol.92, 1980.

T. A. Mogensen, RSSA: A Reversible SSA Form, Lecture Notes in Computer Science, vol.9609, pp.203-217, 2016.

T. A. Mogensen, Reversible Garbage Collection for Reversible Functional Languages, New Generation Computing, vol.36, issue.3, pp.203-232, 2018.

K. Morita, Theory of Reversible Computing, An EATCS Series, 2017.

K. Morita and M. Harao, Computation-universality of one-dimensional one-way reversible cellular automata, Information Processing Letters, vol.42, issue.6, pp.325-329, 1992.

D. Morrison and I. Ulidowski, Direction-Reversible Self-Timed Cellular Automata for Delay-Insensitive Circuits, Lecture Notes in Computer Science, vol.12, pp.367-377, 2014.

M. R. Mousavi, M. A. Reniers, and J. F. Groote, SOS formats and meta-theory: 20 years after, Theoretical Computer Science, vol.373, issue.3, pp.238-272, 2007.

T. Murata, Petri nets: Properties, analysis and applications, Proceedings of the IEEE, vol.77, issue.4, pp.541-580, 1989.

N. Nishida, A. Palacios, and G. Vidal, Reversible computation in term rewriting, Journal of Logical and Algebraic Methods in Programming, vol.94, pp.128-149, 2018.

N. Nishida, A. Palacios, and G. Vidal, A Reversible Semantics for Erlang, Logic-Based Program Synthesis and Transformation, vol.10184, pp.259-274, 2017.

N. Nishida, A. Palacios, and G. Vidal, Reversible computation in term rewriting, Journal of Logical and Algebraic Methods in Programming, vol.94, pp.128-149, 2018.

N. Nishida and G. Vidal, Dagstuhl Manifesto, Informatik-Spektrum, vol.34, issue.4, pp.413-423, 2011.

N. Nishida and G. Vidal, Characterizing Compatible View Updates in Syntactic Bidirectionalization, Reversible Computation, vol.11497, pp.67-83, 2019.

L. Paolini and M. Piccolo, A Process-Model for Linear Programs, Lecture Notes in Computer Science, vol.69, pp.289-305, 2009.

G. P?un, Computing with membranes, J. Comput. Syst. Sci, vol.61, issue.1, pp.108-143, 2000.

A. Philippou and K. Psara, Reversible Computation in Petri Nets, Reversible Computation, vol.11106, pp.84-101, 2018.

A. Philippou, K. Psara, and H. Siljak, Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications, Reversible Computation, vol.11497, pp.238-245, 2019.

I. Phillips and I. Ulidowski, Reversibility and asymmetric conflict in event structures, Journal of Logical and Algebraic Methods in Programming, vol.84, issue.6, pp.781-805, 2015.

I. Phillips, I. Ulidowski, and S. Yuen, A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway, Reversible Computation, vol.7581, pp.218-232, 2013.

I. Phillips, I. Ulidowski, and S. Yuen, Modelling of Bonding with Processes and Events, Reversible Computation, vol.7948, pp.141-154, 2013.

I. Phillips and I. Ulidowski, Reversing Algebraic Process Calculi, Lecture Notes in Computer Science, vol.3921, pp.246-260, 2006.

I. C. Phillips and I. Ulidowski, Reversing algebraic process calculi, The Journal of Logic and Algebraic Programming, vol.73, issue.1-2, pp.70-96, 2007.

J. Pin, On reversible automata, LATIN '92, vol.583, pp.401-416
URL : https://hal.archives-ouvertes.fr/hal-00019977

G. M. Pinna, M. Gheorghe, G. Rozenberg, and A. Salomaa, Reversing steps in membrane systems computations, CMC 2017, vol.10725, pp.245-261, 2018.

P. Rebentrost, M. Mohseni, and S. Lloyd, Quantum Support Vector Machine for Big Data Classification, Physical Review Letters, vol.113, issue.13, p.130503, 2014.

W. Reisig, Petri Nets, EATCS Monographs on Theoretical Computer Science, vol.4, 1985.

A. Rensink and W. Vogler, Fair testing, Information and Computation, vol.205, issue.2, pp.125-198, 2007.

A. Sabry, B. Valiron, and J. K. Vizzotto, From Symmetric Pattern-Matching to Quantum Control, Lecture Notes in Computer Science, vol.10803, pp.348-364, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01763568

V. Salo, Groups and Monoids of Cellular Automata, Cellular Automata and Discrete Complex Systems, vol.9099, pp.17-45, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01442480

V. Salo and I. Törmä, A One-Dimensional Physically Universal Cellular Automaton, Unveiling Dynamics and Complexity, vol.10307, pp.375-386, 2017.

V. Salo and I. Törmä, A One-Dimensional Physically Universal Cellular Automaton, Unveiling Dynamics and Complexity, pp.375-386, 2017.

L. Schaeffer, A Physically Universal Cellular Automaton, Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science - ITCS '15, pp.237-246, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01442481

M. Schordan, T. Oppelstrup, D. Jefferson, and P. D. Barnes, Generation of Reversible C++ Code for Optimistic Parallel Discrete Event Simulation, New Generation Computing, vol.36, issue.3, pp.257-280, 2018.

M. Schordan, T. Oppelstrup, M. K. Thomsen, and R. Glück, Reversible Languages and Incremental State Saving in Optimistic Parallel Discrete Event Simulation, Reversible Computation: Extending Horizons of Computing, vol.12070, pp.187-207, 2020.

U. P. Schultz and H. B. Axelsen, Elements of a Reversible Object-Oriented Language, Reversible Computation, vol.9720, pp.153-159, 2016.

P. Selinger, Dagger Compact Closed Categories and Completely Positive Maps, Electronic Notes in Theoretical Computer Science, vol.170, pp.139-163, 2007.

P. Selinger, A Survey of Graphical Languages for Monoidal Categories, New Structures for Physics, vol.813, pp.289-355, 2010.

J. R. Slagle, Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity, Journal of the ACM, vol.21, issue.4, pp.622-642, 1974.

K. Sutner, Linear Cellular Automata and de Bruijn Automata, Cellular Automata, vol.5, pp.303-319, 1999.

T. , Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science, vol.55, 2003.

F. Tiezzi and N. Yoshida, Reversible session-based pi-calculus, Journal of Logical and Algebraic Methods in Programming, vol.84, issue.5, pp.684-707, 2015.

T. Toffoli, Computation and construction universality of reversible cellular automata, Journal of Computer and System Sciences, vol.15, issue.2, pp.213-231, 1977.

T. Toffoli and N. Margolus, Cellular Automata Machines, 1987.

D. Windridge, R. Mengoni, and R. Nagarajan, Quantum error-correcting output codes, International Journal of Quantum Information, vol.16, issue.08, p.1840003, 2018.

D. Windridge and R. Nagarajan, Quantum Bootstrap Aggregation, Quantum Interaction, vol.10106, pp.115-121, 2017.

D. Windridge and R. Nagarajan, Quantum Bootstrap Aggregation, Quantum Interaction, pp.115-121, 2017.

T. Yokoyama, H. B. Axelsen, and R. Glück, Towards a Reversible Functional Language, Reversible Computation, vol.7165, pp.14-29, 2012.

T. Yokoyama, H. B. Axelsen, and R. Glück, Fundamentals of reversible flowchart languages, Theoretical Computer Science, vol.611, pp.87-115, 2016.