本文探讨了在CCS（Communicating Sequential Processes）中，弱观测一致性（WeakObservationalCongruence, woc）的局限性，因为它不确保通过woc等价的计算到达的状态仍然保持woc。为解决这一问题，我们引入了动态观察等价性（DynamicObservationalCongruence），这是一种粗粒度的 bisimulation 同时也是 congruence。它适用于处理并发系统中动态（运行时）配置的模拟。此外，我们还定义了进步模拟（ProgressingBisimulation），要求进程在执行显式步骤时彼此模拟。文章提供了动态等价性和进步模拟的代数刻画，并证明两者在CCS代理中相等。
摘要：
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still woc, e.g. \alpha.au.\beta.nil and \alpha.\beta.nil are woc but au.\beta.nil and \beta.nil are not. This fact prevent us from characterizing CCS semantics (when au is considered invisible) as a final algebra, since the semantic function would induce an equivalence over the agents that is both a congruence and a bisimulation. In the paper we introduce a new behavioural equivalence for CCS agents, which is the coarsest among those bisimulations which are also congruences. We call it Dynamic Observational Congruence because it expresses a natural notion of equivalence for concurrent systems required to simulate each other in the presence of dynamic, i.e. run time, (re)configurations. We provide an algebraic characterization of Dynamic Congruence in terms of a universal property of finality. Furthermore we introduce Progressing Bisimulation, which forces processes to simulate each other performing explicit steps. We provide an algebraic characterization of it in terms of finality, two logical characterizations via modal logic in the style of HML and a complete axiomatization for finite agents (consisting of the axioms for Strong Observational Congruence and of two of the three Milner's $au$-laws). Finally, we prove that Dynamic Congruence and Progressing Bisimulation coincide for CCS agents.
展开
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
