TY  - JOUR
EP  - 133
N2  - 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.
TI  - Testing Equivalences for Processes
UR  - http://www.sciencedirect.com/science/article/pii/0304397584901130
ID  - eprints393
SP  - 83
VL  - 34
SN  - 0304-3975
JF  - Theoretical Computer Science
PB  - Elsevier
Y1  - 1984///
AV  - none
A1  - Hennessy, Matthew
A1  - De Nicola, Rocco
ER  -