A Complete Equational Axiomatization for MPA with String Iteration
Luca Aceto May 1995 |

## Abstract: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 obtained by restricting the first argument
to be a non-empty sequence of atomic actions. We show that, for every
positive integer
Available as |

Last modified: 2003-06-08 by webmaster.