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

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, M. Koutny, ?. Mikulski, and M. Pi?tkowski, Reversible computation vs. reversibility in Petri nets, Science of Computer Programming, vol.151, pp.48-60, 2018.

K. Barylska and ?. Mikulski, On decidability of persistence notions, 24th Workshop on Concurrency, Specification and Programming, pp.44-56, 2015.

C. H. Bennett, Logical reversibility of computation, IBM J. Res. Dev, vol.17, issue.6, pp.525-532, 1973.

E. Best and J. Esparza, Existence of home states in Petri nets is decidable, Inf. Process. Lett, vol.116, issue.6, pp.423-427, 2016.

Z. Bouziane and A. Finkel, Cyclic petri net reachability sets are semi-linear effectively constructible, Infinity, ENTCS, pp.15-24, 1997.

E. Cardoza, R. Lipton, and A. Meyer, Exponential space complete problems for Petri nets and commutative semigroups (preliminary report), Proceedings of STOC'76, pp.50-54, 1976.

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

M. Colange, S. Baarir, F. Kordon, and Y. Thierry-mieg, Crocodile: a symbolic/symbolic tool for the analysis of symmetric nets with bag, ATPN, pp.338-347, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01282493

W. Czerwi?ski, S. Lasota, R. Lazic, J. Leroux, and F. Mazowiecki, The reachability problem for petri nets is not elementary, 2018.

V. Danos and J. Krivine, Reversible communicating systems, Proceedings of CONCUR'04, pp.292-307, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00784051

D. De-frutos-escrig and C. Johnen, Decidability of home space property, 1989.

L. E. Dickson, Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors, American Journal of Mathematics, vol.35, issue.4, pp.413-422, 1913.

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

A. , The minimal coverability graph for Petri nets, ATPN'91, pp.210-243, 1991.

A. Francalanza, C. A. Mezzina, and E. Tuosto, Reversible choreographies via monitoring in erlang, DAIS, pp.75-92, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01824635

S. Ginsburg and E. Spanier, Bounded ALGOL-like languages, Transactions of the American Mathematical Society, vol.113, issue.2, pp.333-368, 1964.

M. Hack, Petri nets and commutative semigroups, MIT Lab. for Comp. Sci, 1974.

M. Hack, Decidability questions for Petri nets, 1976.

S. Haddad, F. Kordon, L. Petrucci, J. Pradat-peyre, and L. Treves, Efficient state-based analysis by introducing bags in Petri nets color domains, ACC, pp.5018-5025, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00772677

P. Jancar, Undecidability of bisimilarity for petri nets and some related problems, Theoretical Computer Science, vol.148, issue.2, pp.281-301, 1995.

D. Kezi?, N. Peri?, and I. Petrovi?, An algorithm for deadlock prevention based on iterative siphon control of Petri net. Automatika:?asopis za automatiku, mjerenje, elektroniku, ra?unarstvo i komunikacije, vol.47, pp.19-30, 2006.

R. Landauer, Irreversibility and heat generated in the computing process, IBM Journal of Research and Development, vol.5, pp.183-191, 1961.

I. Lanese, C. A. Mezzina, A. Schmitt, and J. Stefani, Controlling reversibility in higher-order pi, CONCUR, pp.297-311, 2011.

I. Lanese, N. Nishida, A. Palacios, and G. Vidal, A theory of reversibility for Erlang, J. of Logical and Algebraic Methods in Programming, vol.100, pp.71-97, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01912856

J. S. Laursen, U. P. Schultz, and L. Ellekilde, Automatic error recovery in robot assembly operations using reverse execution, IROS, pp.1785-1792, 2015.

J. Leroux, Vector addition system reversible reachability problem, CONCUR'11, pp.327-341, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00959696

J. Mcnellis, J. Mola, and K. Sykes, Time travel debugging: Root causing bugs in commercial scale software, 2017.

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

S. A. Reveliotis and J. Y. Choi, Designing reversibility-enforcing supervisors of polynomial complexity for bounded Petri nets through the theory of regions, ICATPN'06, pp.322-341, 2006.

V. V. Shende, A. K. Prasad, I. L. Markov, and J. P. Hayes, Synthesis of reversible logic circuits, IEEE Trans. on CAD of Integr. Circuits Syst, vol.22, issue.6, pp.710-722, 2003.

T. Yokoyama and R. Glück, A reversible programming language and its invertible self-interpreter, PEPM, pp.144-153, 2007.