eprintid: 324
rev_number: 11
eprint_status: archive
userid: 32
dir: disk0/00/00/03/24
datestamp: 2011-06-01 09:33:19
lastmod: 2011-07-11 14:36:26
status_changed: 2011-06-01 09:33:19
type: article
metadata_visibility: show
item_issues_count: 0
creators_name: Boreale, Michele
creators_name: De Nicola, Rocco
creators_name: Pugliese, Rosario
creators_id: 
creators_id: r.denicola@imtlucca.it
creators_id: 
title: Trace and Testing Equivalence on Asynchronous Processes
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: 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. 
date: 2002
date_type: published
publication: Information and Computation
volume: 172
number: 2
publisher: Elsevier
pagerange: 139-164
id_number: 10.1006/inco.2001.3080
refereed: TRUE
issn: 0890-5401
official_url: http://www.sciencedirect.com/science/article/pii/S0890540101930809
funders: Work partially supported by progetto cofinantiato TOSCA.
citation:   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)