A finite equational base for CCS with left merge and communication merge-Reference-Cited by-同舟云学术

A finite equational base for CCS with left merge and communication merge

Published:2009-01 Issue:1 Volume:10 Page:1-26
ISSN:1529-3785
Container-title:ACM Transactions on Computational Logic
language:en
Short-container-title:ACM Trans. Comput. Logic

Author:

Aceto Luca¹,Fokkink Wan²,Ingolfsdottir Anna¹,Luttik Bas³

Affiliation:

1. Reykjavík University, Reykjavik, Iceland

2. Vrije Universiteit Amsterdam and CWI, Amsterdam, The Netherlands

3. Technische Universiteit Eindhoven and CWI, Eindhoven, The Netherlands

Abstract

Using the left merge and the communication merge from ACP, we present an equational base (i.e., a ground-complete and ω-complete set of valid equations) for the fragment of CCS without recursion, restriction and relabeling modulo (strong) bisimilarity. Our equational base is finite if the set of actions is finite.

Funder

Icelandic Centre for Research

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/1459010.1459016

Reference22 articles.

1. CCS with Hennessy's merge has no finite-equational axiomatization

2. Aceto L. Fokkink W. J. Ingolfsdottir A. and Luttik B. 2005b. Finite equational bases in process algebra: Results and open questions. In Processes Terms and Cycles: Steps on the Road to Infinity A. Middeldorp V. van Oostrom F. van Raamsdonk and R. C. de Vrijer Eds. Lecture Notes in Computer Science vol. 3838. Springer-Verlag Berlin Germany 338--367. Aceto L. Fokkink W. J. Ingolfsdottir A. and Luttik B. 2005b. Finite equational bases in process algebra: Results and open questions. In Processes Terms and Cycles: Steps on the Road to Infinity A. Middeldorp V. van Oostrom F. van Raamsdonk and R. C. de Vrijer Eds. Lecture Notes in Computer Science vol. 3838. Springer-Verlag Berlin Germany 338--367.

3. A Ground-Complete Axiomatization of Finite State Processes in Process Algebra

4. Process algebra for synchronous communication

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?;ACM Transactions on Computational Logic;2022-10-20

2. On the Axiomatisability of Parallel Composition;Logical Methods in Computer Science;2022-01-19

3. Non-finite Axiomatisability Results via Reductions: CSP Parallel Composition and CCS Restriction;Lecture Notes in Computer Science;2022

4. In search of lost time: Axiomatising parallel composition in process algebras;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29

5. Honesty by typing;Logical Methods in Computer Science;2017-04-27