CCS with Hennessy's merge has no finite-equational axiomatization
type: Item
instance of: scholarly article
title: CCS with Hennessy's merge has no finite-equational axiomatization
zbMATH Open document ID: 1078.68102
author: Luca Aceto
author: Anna Ingolfsdottir
author: Bas Luttik
author: Wan Fokkink
published in: Theoretical Computer Science
publication date: 2005-02-22T00:00:00Z
full work available at URL: https://ir.cwi.nl/pub/14520
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 08A70
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 03C05
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q70
zbMATH DE Number: 2136583
zbMATH Keywords: Concurrency
zbMATH Keywords: Process algebra
zbMATH Keywords: CCS
zbMATH Keywords: Bisimulation
zbMATH Keywords: Hennessy merge
zbMATH Keywords: Left merge
zbMATH Keywords: Communication merge
zbMATH Keywords: Equational logic
zbMATH Keywords: Complete axiomatizations
zbMATH Keywords: Non-finitely based algebras
MaRDI profile type: Publication
OpenAlex ID: W2222296167
cites work: On “Axiomatising Finite Concurrent Processes”
cites work: Q3395976
cites work: Turning SOS rules into equations
cites work: Structural operational semantics.
cites work: Algèbre de processus et synchronisation
cites work: A brief history of process algebra
cites work: Q4736873
cites work: Process Algebra
cites work: Process algebra for synchronous communication
cites work: TAPSOFT '95: Theory and practice of software development. 6th international joint conference CAAP/FASE, Aarhus, Denmark, May 1995. Proceedings
cites work: Free shuffle algebras in language varieties
cites work: Varieties generated by languages with poset operations
cites work: Axiomatizing shuffle and concatenation in languages
cites work: Higher-level synchronising devices in Meije-SCCS
cites work: Axiomatizing the subsumption and subword preorders on finite and infinite partial words
cites work: Nonfinite axiomatizability of the equational theory of shuffle
cites work: Q4501680
cites work: Q2754192
cites work: The equational theory of pomsets
cites work: Q3922196
cites work: Axiomatising Finite Concurrent Processes
cites work: Q3997501
cites work: Algebraic laws for nondeterminism and concurrency
cites work: Q3777424
cites work: Formal verification of parallel programs
cites work: Flowgraphs and Flow Algebras
cites work: Q3992568
cites work: Unique decomposition of processes
cites work: Q4038732
cites work: Q3999206
cites work: Q3907077
cites work: Modeling concurrency with partial orders
cites work: Languages under concatenation and shuffling
DOI: 10.1016/J.TCS.2004.10.003
description: scientific article; zbMATH DE number 2136583