eprintid: 341
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/03/41
datestamp: 2011-06-06 13:48:29
lastmod: 2011-07-11 14:36:26
status_changed: 2011-06-06 13:48:29
type: book_section
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: A Theory of "May" Testing for Asynchronous Languages
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: Asynchronous communication mechanisms are usually a basic ingredient of distributed systems and protocols. For these systems, asynchronous may-based testing seems to be exactly what is needed to capture safety and certain security properties. We study may testing equivalence focusing on the asynchronous versions of CCS and π-calculus. We start from an operational testing preorder and provide finitary and fully abstract trace-based interpretations for it, together with complete inequational axiomatizations. The results throw light on the differences between synchronous and asynchronous systems and on the weaker testing power of asynchronous observations. 
date: 1999
date_type: published
series: Lecture Notes in Computer Science
volume: 1578
publisher: Springer
pagerange: 165-179
id_number: 10.1007/3-540-49019-1_12
refereed: TRUE
isbn: 3-540-65719-3
book_title: Foundations of Software Science and Computation Structures (FoSSaCS 1999)
editors_name: Thomas, Wolfgang
official_url: http://dx.doi.org/10.1007/3-540-49019-1_12
citation:   Boreale, Michele and De Nicola, Rocco and Pugliese, Rosario  A Theory of "May" Testing for Asynchronous Languages.   In:  Foundations of Software Science and Computation Structures (FoSSaCS 1999).   Lecture Notes in Computer Science, 1578 .  Springer, pp. 165-179.  ISBN 3-540-65719-3      (1999)