TY  - CHAP
EP  - 560
T2  - Automata, Languages and Programming (ICALP 1983)
ID  - eprints395
UR  - http://dx.doi.org/10.1007/BFb0036936
AV  - none
TI  - Testing Equivalence for Processes
M1  - 154
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.
SN  - 3-540-12317-2
ED  - Diaz, Josep
Y1  - 1983///
SP  - 548
T3  - Lecture Notes in Computer Science
A1  - De Nicola, Rocco
A1  - Hennessy, Matthew
PB  - Springer
ER  -