%T Trace and Testing Equivalence on Asynchronous Processes
%P 139-164
%I Elsevier
%V 172
%A Michele Boreale
%A Rocco De Nicola
%A Rosario Pugliese
%D 2002
%L eprints324
%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. 
%N 2
%R 10.1006/inco.2001.3080
%J Information and Computation