Boreale, Michele and De Nicola, Rocco and Pugliese, Rosario Trace and Testing Equivalence on Asynchronous Processes. Information and Computation, 172 (2). pp. 139-164. ISSN 0890-5401 (2002)Full text not available from this repository.
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.
|Funders:||Work partially supported by progetto cofinantiato TOSCA.|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Rocco De Nicola|
|Date Deposited:||01 Jun 2011 09:33|
|Last Modified:||11 Jul 2011 14:36|
Actions (login required)