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

Authors:
Luca Aceto;Wan Fokkink;Anna Ingolfsdottir;Bas Luttik
Affiliations:
Reykjavík University, Reykjavik, Iceland;Vrije Universiteit Amsterdam and CWI, Amsterdam, The Netherlands;Reykjavík University, Reykjavik, Iceland;Technische Universiteit Eindhoven and CWI, Eindhoven, The Netherlands
Venue:
ACM Transactions on Computational Logic (TOCL)
Year:
2009

Citing 14
Cited 4

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
A complete axiomatisation for observational congruence of finite-state behaviours

Information and Computation
Unique decomposition of processes

Theoretical Computer Science
Communication and Concurrency

Communication and Concurrency
A Calculus of Communicating Systems

A Calculus of Communicating Systems
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
A ground-complete axiomatization of finite state processes in process algebra

CONCUR 2005 - Concurrency Theory
Finite equational bases in process algebra: results and open questions

Processes, Terms and Cycles

Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet

Information Processing Letters
Axiomatizing weak ready simulation semantics over BCCSP

ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Rule formats for distributivity

Theoretical Computer Science
Unique parallel decomposition in branching and weak bisimulation semantics

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.