Reversible computation in nets with bonds (Q2667186)

This paper proposes a reversible model inspired by Petri nets that allows the modelling of reversibility as realized by backtracking, causal-order reversing, and out-of-causal-order reversing. The model employs named tokens that can be connected together to form bonds. Furthermore, reversing Petri nets satisfy the conservation property in the sense that the number of tokens in the net remains constant during execution. In the presence of individual tokens, this implies that the set of tokens is preserved.