On the Completeness of the Equations for the Kleene Star in bisimulation
Cached
Download Links
by
Wan Fokkink
| Citations: | 7 - 3 self |
BibTeX
@MISC{Fokkink_onthe,
author = {Wan Fokkink},
title = {On the Completeness of the Equations for the Kleene Star in bisimulation},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A classical result from Redko [14] says that there does not exist a complete finite equational axiomatization for the Kleene star modulo trace equivalence. Fokkink and Zantema [9] showed that there does exist a complete finite equational axiomatization for the Kleene star up to strong bisimulation equivalence. Their proof is based on a sophisticated term rewriting analysis. In this paper, we present amuch simpler and shorter completeness proof. Furthermore, we show that the three equations for the Kleene star are all essential for this completeness result.
