%0 Book Section
%A Boreale, Michele
%A De Nicola, Rocco
%A Pugliese, Rosario
%B Foundations of Software Science and Computation Structures (FoSSaCS 1999)
%D 1999
%E Thomas, Wolfgang
%F eprints:341
%I Springer
%P 165-179
%S Lecture Notes in Computer Science
%T A Theory of "May" Testing for Asynchronous Languages
%U http://eprints.imtlucca.it/341/
%V 1578
%X Asynchronous communication mechanisms are usually a basic ingredient of distributed systems and protocols. For these systems, asynchronous may-based testing seems to be exactly what is needed to capture safety and certain security properties. We study may testing equivalence focusing on the asynchronous versions of CCS and π-calculus. We start from an operational testing preorder and provide finitary and fully abstract trace-based interpretations for it, together with complete inequational axiomatizations. The results throw light on the differences between synchronous and asynchronous systems and on the weaker testing power of asynchronous observations.