Deciding observational congruence of finite-state CCS expressions by rewriting

P. Inverardi, M. Nesi
1995 Theoretical Computer Science  
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 the
more » ... tization by proving that every structured fair derivation computes a term that denotes an rz-normal process graph. The existence of a finite representation for o~-normal forms allows the definition of a rewritin9 strateoy that, in a finite number of rewriting steps, decides observational congruence of guarded recursive (finite-state) CCS expressions. * Corresponding author. Present address: Dipartimento di Matematica Pura ed Applicata, Universit~ di L'Aquila, via Vetoio, Coppito, 67010 L'Aquila, Italy. 0304-3975/95/$09.50 © 1995--Elsevier Science B.V. All rights reserved SSDI 0304-3975(94)00074-S
doi:10.1016/0304-3975(94)00074-s fatcat:aayhbmidq5dazkqs4rz3h5sfye