uCRL resemblesymbolic representations of transition systems, that can be further transformed and analyzed by many of the existing toolsand techniques. We aim at proving the correctness of this linearization algorithm. To this end we use an equivalence rela-tion on recursive specifications in uCRL that is model inde-pendent and does not involve an explicit notion of solution. 1 Introduction In this paper we address the issue of linearization of recur-sive specifications in the specification language