On Process Equivalence = Equation Solving in CCS
Journal of Automated Reasoning
Theories of Programming and Formal Methods
| Hi-index | 0.00 |
We investigate the use of unique fixpoint induction as a proof method for value-passing process languages with recursion. An intuitive generalization of unique fixpoint induction based on loop invariants for symbolic graphs yields strong completeness results; we give an axiomatic characterization of both late and early observational congruence for a class of fully parameterised processes. This new, generalised, rule is shown to be derivable from existing formulations of unique fixpoint induction for value-passing calculi, thereby providing original completeness results. An example of the use of this new rule is presented in detail.