TY  - JOUR
ID  - eprints324
EP  - 164
SP  - 139
TI  - Trace and Testing Equivalence on Asynchronous Processes
N2  - 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. 
AV  - none
SN  - 0890-5401
IS  - 2
JF  - Information and Computation
UR  - http://www.sciencedirect.com/science/article/pii/S0890540101930809
A1  - Boreale, Michele
A1  - De Nicola, Rocco
A1  - Pugliese, Rosario
Y1  - 2002///
PB  - Elsevier
VL  - 172
ER  -