A complete equational axiomatization for MPA with string iteration
We study equational axiomatizations of bisimulation equivalence for the language obtained by extending Milner's basic CCS with string iteration. String iteration is a variation on the original binary version of the Kleene star operation $p^* q$ obtained by restricting the first argument to be a non-empty sequence of atomic actions. We show that, for every positive integer $k$, bisimulation equivalence over the set of processes in this language with loops of length at most $k$ is finitely axiomatizable, provided that the set of actions is finite. We also offer an infinite equational theory that completely axiomatizes bisimulation equivalence over the whole language. We prove that this result cannot be improved upon by showing that no finite equational axiomatization of bisimulation equivalence over basic CCS with string iteration can exist, unless the set of actions is empty.
|Formal Definitions and Theory (acm D.3.1), Semantics of Programming Languages (acm F.3.2), Grammars and Other Rewriting Systems (acm F.4.2)|
|Theory of computing (msc 68Qxx), Grammars and rewriting systems (msc 68Q42)|
|Software Engineering [SEN]|
Aceto, L, & Groote, J.F. (1997). A complete equational axiomatization for MPA with string iteration. Software Engineering [SEN]. CWI.