Reversible computation has attracted increasing interest in recent years. In this paper, we show how to model reversibility in concurrent computation as realised abstractly in terms of event structures. Two different forms of event structures are considered, namely event structures defined by causation and prevention relations and event structures given by an enabling relation with prevention. We then show how to reverse the two kinds of event structures, and discuss causal as well as out-of-causal order reversibility.

中文翻译：

---

反转事件结构

近年来，可逆计算引起了越来越多的兴趣。在本文中，我们展示了如何根据事件结构抽象地实现并发计算中的可逆性建模。考虑了两种不同形式的事件结构，即由因果关系和预防关系定义的事件结构和由与预防的促成关系给出的事件结构。然后我们展示如何反转这两种事件结构，并讨论因果和无因果顺序的可逆性。