@incollection{eprints341,
            year = {1999},
          series = {Lecture Notes in Computer Science},
           title = {A Theory of "May" Testing for Asynchronous Languages},
           pages = {165--179},
          volume = {1578},
       booktitle = {Foundations of Software Science and Computation Structures (FoSSaCS 1999)},
          editor = {Wolfgang Thomas},
          author = {Michele Boreale and Rocco De Nicola and Rosario Pugliese},
       publisher = {Springer},
        abstract = {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 {\ensuremath{\pi}}-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. },
             url = {http://eprints.imtlucca.it/341/}
}