eprintid: 364
rev_number: 8
eprint_status: archive
userid: 32
dir: disk0/00/00/03/64
datestamp: 2011-06-14 13:29:28
lastmod: 2011-07-11 14:36:27
status_changed: 2011-06-14 13:29:28
type: article
metadata_visibility: show
item_issues_count: 0
creators_name: Boreale, Michele
creators_name: De Nicola, Rocco
creators_id: 
creators_id: r.denicola@imtlucca.it
title: Testing Equivalence for Mobile Processes
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: The impact of applying the testing approach to a calculus of processes with dynamic communication topology is investigated. A proof system is introduced that consists of two groups of laws: those for strong observational equivalence and those needed to deal with invisible actions. Soundness and completeness of this proof system w.r.t. a testing preorder are shown. A fully abstract denotational model for the language is presented that takes advantage of reductions of processes to normal forms.

date: 1995
date_type: published
publication: Information and Computation
volume: 120
number: 2
publisher: Elsevier
pagerange: 279-303
id_number: 10.1006/inco.1995.1114
refereed: TRUE
issn: 0890-5401
official_url: http://www.sciencedirect.com/science/article/pii/S0890540185711145
citation:   Boreale, Michele and De Nicola, Rocco  Testing Equivalence for Mobile Processes.  Information and Computation, 120 (2).  pp. 279-303.  ISSN 0890-5401      (1995)