TY - CHAP
T1 - Non-finite Axiomatisability Results via Reductions: CSP Parallel Composition and CCS Restriction.
AU - Aceto, Luca
AU - Anastasiadi, Elli
AU - Castiglioni, Valentina
AU - Ingólfsdóttir, Anna
N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
PY - 2022
Y1 - 2022
N2 - This paper studies the existence of finite, ground-complete axiomatisations of CSP-like parallel composition operators, and the restriction operator from CCS, modulo bisimilarity. More specifically, we build on Moller’s result to the effect that bisimilarity does not have a finite, ground-complete equational axiomatisation over a minimal fragment of CCS, and we use a reduction technique by Aceto et al. to lift it to various extensions of BCCSP with CSP-like parallel operators, and to the recursion and relabelling free fragment of CCS.
AB - This paper studies the existence of finite, ground-complete axiomatisations of CSP-like parallel composition operators, and the restriction operator from CCS, modulo bisimilarity. More specifically, we build on Moller’s result to the effect that bisimilarity does not have a finite, ground-complete equational axiomatisation over a minimal fragment of CCS, and we use a reduction technique by Aceto et al. to lift it to various extensions of BCCSP with CSP-like parallel operators, and to the recursion and relabelling free fragment of CCS.
UR - http://www.scopus.com/inward/record.url?scp=85138160561&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-15629-8_1
DO - 10.1007/978-3-031-15629-8_1
M3 - Chapter
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 26
BT - A Journey from Process Algebra via Timed Automata to Model Learning
ER -