This paper provides a fully abstract semantics for a variant
of the concurrent object calculus. We define may testing
for concurrent object components and then characterise it using
a trace semantics inspired by UML interaction diagrams.
The main result of this paper is to show that the trace semantics is
fully abstract for may testing. This is the first such result for a
concurrent object language.
