论文标题
可逆性如何解决传统问题：遗传性保存历史分配的示例
How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation
论文作者
论文摘要
可逆计算开辟了克服某些硬件当前物理局限性的可能性。它还提供了理论上的见解，因为它丰富了多个范式和计算模型，有时会追溯地启发它们。例如，同时进行的可逆计算为通信系统的演算提供了有趣的扩展，但仍然缺乏与研究过程等效性的自然且相关的一分子。我们的论文提出了相等的利用，利用了可逆性的两个方面：向后移动和记忆机制。这种仿真捕获了并发模型（历史和遗传历史保存分配的（H）HPB）的经典等价关系，该模型目前仅部分以过程代数为代数的部分表征。该结果可以深入了解可逆性的表现力，因为落后的移动和捕获HHPB所需的“向后确定性”的记忆机制。
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.
