Equivalence of recursive specifications in process algebra

Abstract

We define an equivalence relation on recursive specifications in process algebra that is model-independent and does not involve an explicit notion of solution. Then we extend this equivalence to the specification language $mu$CRL