1. J.C.M. Baeten, J.A. Bergstra, Global renaming operators in concrete process algebra, Report CS-R8521, Centre for Mathematics and Computer Science, Amsterdam 1985.
2. J.C.M. Baeten, J.A. Bergstra, J.W. Klop, On the consistency of Koomen's Fair Abstraction Rule, Report CS-R8511, Centre for Mathematics and Computer Science, Amsterdam 1985. To appear in Theoret. Comput. Sci.
3. J.C.M. Baeten, J.A. Bergstra, J.W. Klop, Decidability of bisimulation equivalence for processes generating context-free languages, Report CS-R8632, Centre for Mathematics and Computer Science, Amsterdam 1986.
4. J.W. de Bakker, J.A. Bergstra, J.W. Klop, J.-J.Ch. Meyer, Linear time and branching time semantics for recursion with merge, in: Proc. 10th ICALP, Barcelona (J. Díaz, Ed.), Springer LNCS 154, 39–51, 1983; expanded version: Theoret. Comput. Sci. 34 (1984) 135–156.
5. S.D. Brookes, C.A.R. Hoare, W. Roscoe, A Theory of Communicating Sequential Processes, J. Assoc. Comput. Mach. 31, No.3, 560–599.