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

Authors:
Luca Aceto;Wan Fokkink;Anna Ingolfsdottir;Bas Luttik
Affiliations:
Department of Computer Science, Reykjavík University, Iceland;Department of Computer Science, Vrije Universiteit Amsterdam, The Netherlands;Department of Computer Science, Reykjavík University, Iceland;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, The Netherlands
Venue:
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Year:
2006

Citing 10
Cited 3

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Top-down design and the algebra of communicating processes

Science of Computer Programming - Ellis Horwood series in artificial intelligence
Partial evaluation and &ohgr;-completeness of algebraic specifications

Theoretical Computer Science
Axiomatising finite concurrent processes

SIAM Journal on Computing
Communication and Concurrency

Communication and Concurrency
A New Strategy for Proving omega-Completeness applied to Process Algebra

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
CCS with Hennessy's merge has no finite-equational axiomatization

Theoretical Computer Science - Expressiveness in concurrency
Decomposition orders: another generalisation of the fundamental theorem of arithmetic

Theoretical Computer Science - Process algebra
Finite equational bases in process algebra: results and open questions

Processes, Terms and Cycles

On finite alphabets and infinite bases

Information and Computation
On finite alphabets and infinite bases III: simulation

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
The saga of the axiomatization of parallel composition

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using the left merge and 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 restriction and relabelling. Our equational base is finite if the set of actions is finite