1. L. Aceto and M.C.B. Hennessy, “Adding action refinement to a finite process algebra,” Inform. and Comput., Vol. 115, pp. 204–269, 1994.
2. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms., Addison-Wesley, 1974.
3. R.-J. Back and J. von Wright, Refinement Calculus, A Systematic Introduction, Springer, 1998.
4. J. Bergstra, J. Klop, and E.-R. Olderog, “Failure Semantics with fair abstraction,” CWI Report CS-8609, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, 1986.
5. J. Bergstra, J. Klop, and E.-R. Olderog, “Failures without chaos: A new process semantics for fair abstraction,” in M. Wirsing (Eds.), Formal Description of Programming Concepts -III, IFIP, Elsevier Science Publishers B.V., 1987, pp. 77–101.