A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We propose a term rewriting approach to verify observational congruence between guarded recursive (finite-state) CCS expressions. Starting from the complete axiomatization of observational congruence for this subset of CCS, a non-terminating rewriting relation has been defined. This rewriting relation is co-canonical over a subclass of infinite derivations, structured fair derivations, which compute all the m-normal forms. The rewriting relation is shown to be complete with respect to thedoi:10.1016/0304-3975(94)00074-s fatcat:aayhbmidq5dazkqs4rz3h5sfye