1. R. Cleaveland: On Automatically Distinguishing Inequivalent Processes. In Proceedings: 1990 Workshop on Computer-Aided Verification (R. Kurshan and E.M. Clarke, editors), DIMACS technical report 90–31, Vol. 2, New Yersey, 1990. To appear in Lecture Notes in Computer Science.
2. R. DeNicola and F.W. Vaandrager: Three logics for branching bisimulation (extended abstract). In Proceedings 5th Annual Symposium on Logic in Computer Science, Philadelphia, USA, pages 118–129, Los Alamitos, CA, 1990. IEEE Computer Society Press. Full version appeared as CWI Report CS-R9012.
3. R.J. van Glabbeek: Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, Free University, Amsterdam, 1990.
4. R.J. van Glabbeek and W.P. Weijland: Branching time and abstraction in bisimulation semantics (extended abstract). In G.X. Ritter, editor, Information Processing 89, pages 613–618. North-Holland, 1989.
5. J.F. Groote and F.W. Vaandrager: An efficient algorithm for branching bisimulation and stuttering equivalence. In M.S. Paterson, editor, Proceedings 17th ICALP, Warwick, volume 443 of LNCS, pages 626–638. Springer-Verlag, 1990.