1. Alhazov, A., Ivanov, S., Pelz, E., Verlan, S.: Small universal deterministic Petri nets with inhibitor arcs. J. Autom. Lang. Comb. 21(1–2), 7–26 (2016)
2. Axelsen, H.B., Glück, R.: What do reversible programs compute? In: Hofmann, M. (ed.) Foundations of Software Science and Computational Structures - 14th International Conference, FOSSACS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26-April 3, 2011. Proceedings, Lecture Notes in Computer Science, vol. 6604, pp. 42–56. Springer (2011)
3. Barzdin, I.M.: Ob odnom klasse machin Turinga (machiny Minskogo), russian. Algebra i Logika 1, 42–51 (1963)
4. Bennett, C.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525–532 (1973)
5. Bennett, C.H.: Notes on the history of reversible computation. IBM J. Res. Dev. 44(1), 270–278 (2000)