eprintid: 395
rev_number: 11
eprint_status: archive
userid: 32
dir: disk0/00/00/03/95
datestamp: 2011-06-06 14:21:20
lastmod: 2011-07-11 14:36:27
status_changed: 2011-06-06 14:21:20
type: book_section
metadata_visibility: show
item_issues_count: 0
creators_name: De Nicola, Rocco
creators_name: Hennessy, Matthew
creators_id: r.denicola@imtlucca.it
creators_id: 
title: Testing Equivalence 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: 1983
date_type: published
series: Lecture Notes in Computer Science
volume: 154
publisher: Springer
pagerange: 548-560
id_number: 10.1007/BFb0036936
refereed: TRUE
isbn: 3-540-12317-2
book_title: Automata, Languages and Programming (ICALP 1983)
editors_name: Diaz, Josep
official_url: http://dx.doi.org/10.1007/BFb0036936
citation:   De Nicola, Rocco and Hennessy, Matthew  Testing Equivalence for Processes.   In:  Automata, Languages and Programming (ICALP 1983).   Lecture Notes in Computer Science, 154 .  Springer, pp. 548-560.  ISBN 3-540-12317-2      (1983)