%I Springer
%V 1578
%P 165-179
%T A Theory of "May" Testing for Asynchronous Languages
%B Foundations of Software Science and Computation Structures (FoSSaCS 1999)
%R 10.1007/3-540-49019-1_12
%A Michele Boreale
%A Rocco De Nicola
%A Rosario Pugliese
%S Lecture Notes in Computer Science
%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. 
%E Wolfgang Thomas
%L eprints341
%D 1999