%A Michele Boreale
%A Rocco De Nicola
%A Rosario Pugliese
%S Lecture Notes in Computer Science
%E Maurice Nivat
%X We study may and must testing-based preorders in an asynchronous setting. In particular, we provide some full abstraction theorems that offer alternative characterizations of these preorders in terms of context closure w.r.t. basic observables and in terms of traces and acceptance sets. These characterizations throw light on the asymmetry between input and output actions in asynchronous interactions and on the difference between synchrony and asynchrony. 
%L eprints348
%D 1998
%B Foundations of Software Science and Computation Structures (FoSSaCS 1998)
%R 10.1007/BFb0053544
%P 95-109
%T Asynchronous Observations of Processes
%V 1378
%I Springer