1. J.C.M. Baeten, J.A. Bergstra and J.W. Klop. Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. LNCS 259, pp 93–114, 1987.
2. I. Castellani. Bisimulation for Concurrency. Ph.D. Thesis, Edinburgh University, CST-51-88, 1988.
3. D. Caucal. Graphes Canoniques de Graphes Algebriques. Report de Recherche 972, INRIA, Juillet 1988.
4. R.J. van Glabbeek. The Linear Time-Branching Time Spectrum. CONCUR90, LNCS 458, pp 278–297, 1990.
5. J.F. Groote and H. Hüttel. Undecidable Equivalences for Basic Process Algebra. University of Edinburgh, LFCS Report Series, ECS-LFCS-91-169, 1991.