%0 Journal Article
%@ 0890-5401
%A Boreale, Michele
%A De Nicola, Rocco
%A Pugliese, Rosario
%D 2002
%F eprints:324
%I Elsevier
%J Information and Computation
%N 2
%P 139-164
%T Trace and Testing Equivalence on Asynchronous Processes
%U http://eprints.imtlucca.it/324/
%V 172
%X We study trace and may-testing equivalences in the asynchronous versions of CCS and π-calculus. We start from the operational definition of the may-testing preorder and provide finitary and fully abstract trace-based characterizations for it, along with a complete in-equational proof system. We also touch upon two variants of this theory by first considering a more demanding equivalence notion (must-testing) and then a richer version of asynchronous CCS. The results throw light on the difference between synchronous and asynchronous communication and on the weaker testing power of asynchronous observations.