On the greatest solution of equations in CLLR

It is shown that, a recursive equation X = R S t X in the LLTS-oriented process calculus CLL R may have more than one consistent solution when X occurs in the scope of a conjunction in t X , and the recursive term { X | X = t X } is the greatest solution of this equation w.r.t. Luttgen and Vogler's ready simulation whenever X is strongly guarded in t X . In CLL R , for t with strongly guarded X, solutions of X = t are explored further.Recursive processes are characterized as the greatest solutions of equations. { X | X = t } is consistent iff consistent solutions of the equation X = t exist.Unique solution theorem no longer holds if X may occur in conjuncts.