TY  - CHAP
SP  - 165
T3  - Lecture Notes in Computer Science
A1  - Boreale, Michele
A1  - De Nicola, Rocco
A1  - Pugliese, Rosario
PB  - Springer
Y1  - 1999///
ED  - Thomas, Wolfgang
M1  - 1578
N2  - 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. 
SN  - 3-540-65719-3
UR  - http://dx.doi.org/10.1007/3-540-49019-1_12
AV  - none
TI  - A Theory of "May" Testing for Asynchronous Languages
EP  - 179
T2  - Foundations of Software Science and Computation Structures (FoSSaCS 1999)
ID  - eprints341
ER  -