Reversible computation opens up the possibility of overcoming some of the hardware's current physical limitations. It also offers theoretical insights, as it enriches multiple paradigms and models of computation, and sometimes retrospectively enlightens them. Concurrent reversible computation, for instance, offered interesting extensions to the Calculus of Communicating Systems, but was still lacking a natural and pertinent bisimulation to study processes equivalences. Our paper formulates an equivalence exploiting the two aspects of reversibility: backward moves and memory mechanisms. This bisimulation captures classical equivalences relations for denotational models of concurrency (History-and hereditary history-preserving bisimulation, (H)HPB), that were up to now only partially characterized by process algebras. This result gives an insight on the expressiveness of reversibility, as both backward moves and a memory mechanism-providing 'backward determinism'-are needed to capture HHPB.

中文翻译：

---

可逆性如何解决传统问题：遗传历史保存互模拟的例子

可逆计算开辟了克服某些硬件当前物理限制的可能性。它还提供了理论见解，因为它丰富了计算的多种范式和模型，有时还会回顾性地启发它们。例如，并发可逆计算为通信系统微积分提供了有趣的扩展，但仍然缺乏自然和相关的互模拟来研究过程等价。我们的论文利用可逆性的两个方面制定了等价性：向后移动和记忆机制。这种互模拟捕获了并发指称模型的经典等价关系（历史和遗传历史保留互模拟，(H)HPB），到目前为止，这些模型仅部分由过程代数表征。