eprintid: 393
rev_number: 8
eprint_status: archive
userid: 32
dir: disk0/00/00/03/93
datestamp: 2011-05-24 14:46:17
lastmod: 2011-07-11 14:36:27
status_changed: 2011-05-24 14:46:17
type: article
metadata_visibility: show
item_issues_count: 0
creators_name: Hennessy, Matthew
creators_name: De Nicola, Rocco
creators_id: 
creators_id: r.denicola@imtlucca.it
title: Testing Equivalences for Processes
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: Given a set of processes and a set of tests on these processes we show how to define in a natural way three different equivalences on processes. These equivalences are applied to a particular language CCS. We give associated complete proof systems and fully abstract models. These models have a simple representation in terms of trees.
date: 1984
date_type: published
publication: Theoretical Computer Science
volume: 34
publisher: Elsevier
pagerange: 83-133
id_number: 10.1016/0304-3975(84)90113-0
refereed: TRUE
issn: 0304-3975
official_url: http://www.sciencedirect.com/science/article/pii/0304397584901130
citation:   Hennessy, Matthew and De Nicola, Rocco  Testing Equivalences for Processes.  Theoretical Computer Science, 34.  pp. 83-133.  ISSN 0304-3975      (1984)