Branching bisimilarity is a well-known equivalence relation for labelled transition systems. Based on this equivalence relation, with an additional simple rootedness condition, a congruence relation for calculus of communication system (CCS) processes can be obtained. However, neither branching bisimilarity nor the corresponding congruence relation preserves divergence, and it is still a question whether, based on a divergence-preserving variant of branching bisimilarity, a divergence-preserving congruence relation for CCS processes can be obtained by introducing the same simple rootedness condition. In this article, we present a partial solution by showing that rooted divergence-preserving branching bisimilarity is preserved under the usual CCS operators, including prefixing, summation, parallel composition, relabelling, restriction, and (weakly) guarded recursion.

分支双相似性是标记转移系统众所周知的等价关系。基于该等价关系，通过附加简单的根条件，可以获得通信系统演算（CCS）过程的同余关系。然而，分支互相似性和相应的同余关系都不保散，并且基于分支互相似性的保散变体，是否可以通过引入相同的简单根性来获得CCS过程的保散同余关系仍然是一个问题健康）状况。在本文中，我们提出了一个部分解决方案，表明在通常的 CCS 运算符下保留了根保散分支双相似性，包括前缀、求和、并行组合、重新标记、限制和（弱）保护递归。