弱双模拟同余的非有限公理化性

IF 1 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2025-07-11 DOI:10.1016/j.tcs.2025.115453

Luca Aceto , Valentina Castiglioni , Anna Ingólfsdóttir , Bas Luttik

引用次数: 0

摘要

研究了CCS并行组合算子模基于弱双模拟的同余的公构性。具体地说，我们证明了所有比有根分支双相似更粗，比有根弱双相似更细的同余，在CCS的递归、限制和重标记自由片段上不承认有限等式公理化。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Non finite axiomatisability of weak bisimulation-based congruences

We study the axiomatisability of CCS parallel composition operator modulo weak bisimulation-based congruences. Specifically, we prove that all congruences that are coarser than rooted branching bisimilarity, and finer than rooted weak bisimilarity, do not admit a finite equational axiomatisation over the recursion, restriction, and relabelling free fragment of CCS.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.