We propose an automated method for proving termination of $\pi$-calculus processes, based on a reduction to termination of sequential programs: we translate a $\pi$-calculus process to a sequential program, so that the termination of the latter implies that of the former. We can then use an off-the-shelf termination verification tool to check termination of the sequential program. Our approach has been partially inspired by Deng and Sangiorgi's termination analysis for the $\pi$-calculus, and checks that there is no infinite chain of communications on replicated input channels, by converting such a chain of communications to a chain of recursive function calls in the target sequential program. We have implemented an automated tool based on the proposed method and confirmed its effectiveness.

中文翻译：

---

通过归约到顺序程序终止的 $π$-演算的终止分析

我们提出了一种自动方法来证明 $\pi$-calculus 过程的终止，基于对顺序程序终止的简化：我们将 $\pi$-calculus 过程转换为顺序程序，以便后者的终止意味着前者。然后我们可以使用现成的终止验证工具来检查顺序程序的终止。我们的方法部分受到 Deng 和 Sangiorgi 对 $\pi$ 演算的终止分析的启发，并通过将这样的通信链转换为递归函数调用链来检查复制的输入通道上是否没有无限的通信链在目标顺序程序中。我们已经基于所提出的方法实施了一个自动化工具并确认了其有效性。