The University of Southampton
University of Southampton Institutional Repository

A theory of bisimulation for a fragment of concurrent ML with local names

A theory of bisimulation for a fragment of concurrent ML with local names
A theory of bisimulation for a fragment of concurrent ML with local names
Concurrent ML is an extension of Standard ML with ?-calculus-like primitives for multithreaded programming. CML has a reduction semantics, but to date there has been no labelled transition system semantics provided for the entire language. In this paper, we present a labelled transition semantics for a fragment of CML called µvCML which includes features not covered before: dynamically generated local channels and thread identifiers. We show that weak bisimilarity for µvCML is a congruence, and coincides with barbed bisimulation congruence. We also provide a variant of Sangiorgi's normal bisimulation for µvCML, and show that this too coincides with bisimilarity.
0304-3975
1-48
Jeffrey, Alan
d79c647d-86f4-43f2-94d0-78be65748331
Rathke, Julian
dba0b571-545c-4c31-9aec-5f70c231774b
Jeffrey, Alan
d79c647d-86f4-43f2-94d0-78be65748331
Rathke, Julian
dba0b571-545c-4c31-9aec-5f70c231774b

Jeffrey, Alan and Rathke, Julian (2004) A theory of bisimulation for a fragment of concurrent ML with local names Theoretical Computer Science, 323, (1-3), pp. 1-48.

Record type: Article

Abstract

Concurrent ML is an extension of Standard ML with ?-calculus-like primitives for multithreaded programming. CML has a reduction semantics, but to date there has been no labelled transition system semantics provided for the entire language. In this paper, we present a labelled transition semantics for a fragment of CML called µvCML which includes features not covered before: dynamically generated local channels and thread identifiers. We show that weak bisimilarity for µvCML is a congruence, and coincides with barbed bisimulation congruence. We also provide a variant of Sangiorgi's normal bisimulation for µvCML, and show that this too coincides with bisimilarity.

PDF tbfcmllnfull.pdf - Other
Restricted to Registered users only
Download (294kB)

More information

Published date: September 2004
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 263367
URI: http://eprints.soton.ac.uk/id/eprint/263367
ISSN: 0304-3975
PURE UUID: 25851798-5343-4cdb-8be9-b8b57728bf57

Catalogue record

Date deposited: 15 Feb 2007
Last modified: 18 Jul 2017 07:46

Export record

Contributors

Author: Alan Jeffrey
Author: Julian Rathke

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×