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

L. Aceto, W.J. Fokkink, A. Ingolfsdottir, B. Luttik

Research output: Contribution to JournalArticleAcademicpeer-review

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. © 2009 ACM.
Original languageEnglish
Pages (from-to)1-26
JournalACM Transactions on Computational Logic
Volume10
Issue number1:6
DOIs
Publication statusPublished - 2009

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