%0 Book Section
%A De Nicola, Rocco
%A Hennessy, Matthew
%B Automata, Languages and Programming (ICALP 1983)
%D 1983
%E Diaz, Josep
%F eprints:395
%I Springer
%P 548-560
%S Lecture Notes in Computer Science
%T Testing Equivalence for Processes
%U http://eprints.imtlucca.it/395/
%V 154
%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.