1. Decidability of bisimulation equivalence for processes generating context-free languages;Baeten;Journal of the ACM,1993
2. Process Algebra, Cambridge Tracts in Theoretical Computer Science, vol. 18;Baeten,1990
3. Algebraic solutions to recursion schemes;Benson;Journal of Computer and System Sciences,1987
4. Process algebra for synchronous communication;Bergstra;Information and Computation,1984
5. J.A.Bergstra,J.W.Klop,Acompleteinferencesystemforregularprocesseswithsilentmoves,in:F.R.Drake,J.K.Truss(Eds.),ProceedingsLogicColloquiumHull1986,North-Holland,Amsterdam1988,pp. 21–81. First appeared as: Report CS-R8420, CWI, Amsterdam, 1984