A Finite Equational Base for CCS with Left Merge and Communication Merge

Simple item page
dc.creatorAceto, Luca
dc.creatorFokkink, Wan
dc.creatorIngolfsdottir, Anna
dc.creatorLuttik, Bas
dc.date2006-08-01
dc.date2006-08-02
dc.date.accessioned2026-07-07T07:19:55Z
dc.date.available2026-07-07T07:19:55Z
dc.descriptionUsing 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 recursion, restriction and relabelling. Our equational base is finite if the set of actions is finite.
dc.identifierhttps://arxiv.org/abs/cs/0608001
dc.identifierhttp://arxiv.org/abs/cs/0608001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/114807
dc.subjectLogic in Computer Science
dc.subjectD.3.1; F.1.1; F.1.2; F.3.2; F.4.1
dc.titleA Finite Equational Base for CCS with Left Merge and Communication Merge
dc.typetext

Files

Collections

arXiv