@article{eprints324,
          author = {Michele Boreale and Rocco De Nicola and Rosario Pugliese},
       publisher = {Elsevier},
         journal = {Information and Computation},
          number = {2},
           pages = {139--164},
          volume = {172},
            year = {2002},
           title = {Trace and Testing Equivalence on Asynchronous Processes},
             url = {http://eprints.imtlucca.it/324/},
        abstract = {We study trace and may-testing equivalences in the asynchronous versions of CCS and {\ensuremath{\pi}}-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. }
}