A theory of bisimulation for a fragment of concurrent ML with local names
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), 1-48.
Download
|
PDF
Restricted to Registered users only Download (287Kb) | Request a copy |
Description/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.
| Item Type: | Article |
|---|---|
| ISSNs: | 0304-3975 |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science > Electronic & Software Systems |
| Item ID: | 263367 |
| Date Deposited: | 15 Feb 2007 |
| Last Modified: | 02 Mar 2012 13:20 |
| Contributors: | Jeffrey, Alan (Author) Rathke, Julian (Author) |
| Date: | September 2004 |
| Status: | Published |
| Publisher: | Elsevier |
| Further Information: | Google Scholar |
| ISI Citation Count: | 11 |
| URI: | http://eprints.soton.ac.uk/id/eprint/263367 |
Actions (login required)
![]() |
View Item |


