We enrich the operational semantics of a simple process calculus with ACP-style communication with a concurrency relation, so that for every process expression there exists an associated notion of just path . We then present sufficient conditions on the communication function and the syntax of process expressions that facilitate the formulation of justness on the level of labels rather than on individual transitions, taking a designated set of signals into account. This paves the way for the formulation of liveness properties under justness assumptions in the modal $$\mu $$ μ -calculus and their verification on process specifications with the mCRL2 toolset.

中文翻译：

---

仅对路径的活性属性进行现成的自动分析

我们通过具有并发关系的 ACP 样式通信丰富了简单进程演算的操作语义，因此对于每个进程表达式，都存在一个相关的 just path 概念。然后，我们在通信功能和过程表达式的语法上提出了充分条件，这些条件有助于在标签级别而不是单个转换级别上制定公正性，同时考虑到一组指定的信号。这为在模态 $$\mu $$ μ 演算中的公正性假设下制定活性属性铺平了道路，并使用 mCRL2 工具集对流程规范进行了验证。