Go backward to Properties of Strong Equivalence Go up to Top Go forward to Bisimulation and Observation Equivalence

Strong Congruence

• Strong congruence
  • Strong equivalence is substitutive under all combinators and under recursive definitions
• Let P₁ ~ P₂
  • alpha.P₁ ~ alpha.P₂
  • P₁+Q ~ P₂+Q
  • P₁|Q ~ P₂|Q
  • P₁\L ~ P₂\L
  • P₁[f] ~ P₂[f]