1. Aceto, L., Fokkink, W.J., van Glabbeek, R.J., Ingólfsdóttir, A.: Nested semantics over finite trees are equationally hard. Information and Computation 191(2), 203–232 (2004)
2. Lecture Notes in Computer Science;L. Aceto,2007
3. Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. Journal of the ACM 31(3), 560–599 (1984)
4. Chen, T., Fokkink, W.J.: On the axiomatizability of impossible futures: Preorder versus equivalence. In: Proc. LICS 2008, pp. 156–165. IEEE, Los Alamitos (2008)
5. Chen, T., Fokkink, W.J., van Glabbeek, R.J.: On finite bases for weak semantics: Failures versus Impossible futures (2008), http://arxiv.org/abs/0810.4904