<> "The repository administrator has not yet configured an RDF license."^^ . <> . . . "Trace and Testing Equivalence on Asynchronous Processes"^^ . "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. "^^ . "2002" . "172" . "2" . . "Elsevier"^^ . . . "Information and Computation"^^ . . . "08905401" . . . . . . . . . . . . . "Rocco"^^ . "De Nicola"^^ . "Rocco De Nicola"^^ . . "Michele"^^ . "Boreale"^^ . "Michele Boreale"^^ . . "Rosario"^^ . "Pugliese"^^ . "Rosario Pugliese"^^ . . . . . "HTML Summary of #324 \n\nTrace and Testing Equivalence on Asynchronous Processes\n\n" . "text/html" . . . "QA75 Electronic computers. Computer science"@en . .