A Complete Equational Axiomatization for Prefix Iteration with Silent
Steps
Luca Aceto January 1995 |
Abstract:Fokkink ((1994) Inf. Process. Lett. 52: 333-337)
has recently proposed a complete equational axiomatization of strong
bisimulation equivalence for the language obtained by extending Milner's
basic CCS with prefix iteration. Prefix iteration is a variation on the
original binary version of the Kleene star operation Using a technique due
to Groote, we also show that the resulting axiomatization is
Available as PostScript, PDF, DVI. |