1. S. Abramsky (1987): Observation equivalence as a testing equivalence. Theoretical Computer Science 53, pp. 225–241.
2. J.C.M. Baeten & R.J. van Glabbeek (1987): Merge and termination in process algebra. In: Proceedings 7th Conference on Foundations of Software Technology & Theoretical Computer Science, Pune, India (K.V. Nori, ed.), LNCS 287, Springer-Verlag, pp. 153–172.
3. J.C.M. Baeten & F.W. Vaandrager (1989): An algebra for process creation. Report CSR89.., Centrum voor Wiskunde en Informatica, Amsterdam, to appear.
4. J.W. de Bakker & J.N. Kok (1988): Uniform abstraction, atomicity and contractions in the comparative semantics of concurrent Prolog. In: Proceedings Fifth Generation Computer Systems 1988 (FGCS'88), Tokyo, Japan.
5. J.A. Bergstra & J.W. Klop (1988): A complete inference system for regular processes with silent moves. In: Proceedings Logic Colloquium 1986 (F.R. Drake & J.K. Truss, eds.), North Holland, Hull, pp. 21–81, also appeared as: Report CS-R8420, Centrum voor Wiskunde en Informatica, Amsterdam 1984.