On the greatest solution of equations in $\text{CLL}_R$

It is shown that, for any equation $X=_{RS} t_X$ in the LLTS-oriented process calculus $\text{CLL}_R$, if $X$ is strongly guarded in $t_X$, then the recursive term $\langle X|X=t_X \rangle$ is the greatest solution of this equation w.r.t L\"{u}ttgen and Vogler's ready simulation.

[1]  Zhaohui Zhu,et al.  On recursive operations over logic LTS † , 2013, Mathematical Structures in Computer Science.

[2]  Walter Vogler,et al.  Ready simulation for concurrency: It's logical! , 2010, Inf. Comput..

[3]  Walter Vogler,et al.  Safe reasoning with Logic LTS , 2009, Theor. Comput. Sci..

[4]  Jan Friso Groote,et al.  The Meaning of Negative Premises in Transition System Specifications , 1991, ICALP.

[5]  Walter Vogler,et al.  Conjunction on processes: Full abstraction via ready-tree semantics , 2007, Theor. Comput. Sci..