%J Theoretical Computer Science
%R 10.1016/0304-3975(84)90113-0
%D 1984
%V 34
%A Matthew Hennessy
%A Rocco De Nicola
%L eprints393
%I Elsevier
%X Given a set of processes and a set of tests on these processes we show how to define in a natural way three different equivalences on processes. These equivalences are applied to a particular language CCS. We give associated complete proof systems and fully abstract models. These models have a simple representation in terms of trees.
%T Testing Equivalences for Processes
%P 83-133