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

L. Aceto, W.J. Fokkink, A. Ingólfsdóttir, B. Luttik

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationAutomata, Languages and Programming (Proceedings 33rd International Colloquium, ICALP 2006, Venice, Italy, July 9-16, 2006), Part II
EditorsM. Bugliesi, B. Preneel, V. Sassone, I. Wegener
Place of PublicationBerlin
PublisherSpringer
Pages492-503
ISBN (Print)3-540-35907-4
DOIs
Publication statusPublished - 2006

Publication series

NameLecture Notes in Computer Science
Volume4052
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'A finite equational base for CCS with left merge and communication merge'. Together they form a unique fingerprint.

Cite this