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 language | English |
---|---|
Pages (from-to) | 1-26 |
Journal | ACM Transactions on Computational Logic |
Volume | 10 |
Issue number | 1:6 |
DOIs | |
Publication status | Published - 2009 |