可逆性如何解决传统问题：遗传性历史保存互模拟的例子
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
