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 ω-canonical over a subclass of infinite derivations, structured fair derivations, which compute all the ω-normal forms. The rewriting relation is shown to be complete with respect to the axiomatization by proving that every structured fair derivation computes a term that denotes an rτ-normal process graph. The existence of a finite representation for ω-normal forms allows the definition of a rewriting strategy that, in a finite number of rewriting steps, decides observational congruence of guarded recursive (finite-state) CCS expressions.
Deciding Observational Congruence of Finite-State CCS Expressions by Rewriting
INVERARDI, PAOLA;NESI, MONICA
1995-01-01
Abstract
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 ω-canonical over a subclass of infinite derivations, structured fair derivations, which compute all the ω-normal forms. The rewriting relation is shown to be complete with respect to the axiomatization by proving that every structured fair derivation computes a term that denotes an rτ-normal process graph. The existence of a finite representation for ω-normal forms allows the definition of a rewriting strategy that, in a finite number of rewriting steps, decides observational congruence of guarded recursive (finite-state) CCS expressions.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.