A fully abstract may testing semantics for concurrent objects

doi:10.1016/j.tcs.2004.10.012

Theoretical Computer Science

Volume 338, Issues 1–3, 10 June 2005, Pages 17-63

https://doi.org/10.1016/j.tcs.2004.10.012 Get rights and content

Under an Elsevier user license

open archive

Abstract

This paper provides a fully abstract semantics for a variant of the concurrent object calculus. We define may testing for concurrent object components and then characterise it using a trace semantics inspired by UML interaction diagrams. The main result of this paper is to show that the trace semantics is fully abstract for may testing. This is the first such result for a concurrent object language.

Keywords

Object calculus

Full abstraction

Concurrency

Cited by (0)

¹: This material is based upon work supported by the National Science Foundation under Grant No. 0430175.

²: Support provided by Nuffield Foundation Grant NAL/00226/G.