CCS-like calculi can be viewed as an extension of classical automata with communication primitives. We are interested here to follow this principle, applied to tree-automata. It naturally yields a calculus of branching processes (CBP), where the continuations of communications are allowed to branch according to the arity of the communication channel. After introducing the calculus with a reduction semantics we show that CBP can be “implemented” by a fully compositional LTS semantics. We argue that CBP offers an interesting tradeoff between calculi with a fixed communication topology à la CCS and calculi with dynamic connectivity such as the π-calculus.

类似于CCS的结石可被视为具有通信原语的经典自动机的扩展。在这里，我们有兴趣遵循应用于树自动机的这一原则。它自然会产生分支过程（CBP）的演算，其中通信的继续被允许根据通信通道的多样性进行分支。在用简化语义介绍了演算之后，我们表明可以通过完全组成的LTS语义“实现” CBP。我们认为，CBP在具有固定通信拓扑结构CCla的结石与具有π演算等动态连接的结石之间提供了有趣的折衷。