寻找损失的时间:进程代数中并行合成的公理化
In search of lost time: Axiomatising parallel composition in process algebras
摘要:
这项调查回顾了一些最近的成就,在传奇的axiomatisation平行组成,随着一些经典的结果。我们专注于CCS的递归,重新标记和限制自由的片段,我们讨论了解决方案的三个问题,是开放多年。第一个问题涉及的地位Bergstra和Klop的辅助运营商左合并和通信合并在有限公理化的并行组合模bisimilarity:我们认为,在一些自然的假设下,除了一个单一的辅助二进制操作CCS不产生有限公理化的bisimilarity。然后,我们划定的界限之间的有限和非有限的公理化的范Glabbeek的线性时间分支时间谱CCS上的同余。最后,我们提出了一个新的结果的效果,生根弱双相似性没有有限的完全公理化CCS。
英文摘要:
This survey reviews some of the most recent achievements in the saga of the axiomatisation of parallel composition, along with some classic results. We focus on the recursion, relabelling and restriction free fragment of CCS and we discuss the solutions to three problems that were open for many years. The first problem concerns the status of Bergstra and Klop's auxiliary operators left merge and communication merge in the finite axiomatisation of parallel composition modulo bisimiliarity: We argue that, under some natural assumptions, the addition of a single auxiliary binary operator to CCS does not yield a finite axiomatisation of bisimilarity. Then we delineate the boundary between finite and non-finite axiomatisability of the congruences in van Glabbeek's linear time-branching time spectrum over CCS. Finally, we present a novel result to the effect that rooted weak bisimilarity has no finite complete axiomatisation over CCS.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。