%I Springer
%V 154
%P 548-560
%T Testing Equivalence for Processes
%R 10.1007/BFb0036936
%B Automata, Languages and Programming (ICALP 1983)
%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.
%E Josep Diaz
%D 1983
%L eprints395
%S Lecture Notes in Computer Science
%A Rocco De Nicola
%A Matthew Hennessy