File(s) not publicly available
A theory of bisimulation for a fragment of concurrent ML with local names.
presentationposted on 2023-06-08, 08:03 authored by A Jeffrey, J Rathke
Concurrent ML is an extension of Standard ML with p-calculus-like primitives for multi-threaded programming. CML has a reduction semantics, but to date there has been no labelled transitions semantics provided for the entire language. 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 bisimulation for µvCML is a congruence, and coincides with barbed bisimulation congruence. We also provide a variant of D. Sangiorgi's (1993) normal bisimulation for µvCML, and show that this too coincides with bisimulation.
PublisherProceedings of the 15th Annual Symposium on Logic in Computer Science Santa Barbara. IEEE Computer Society Press.
Event locationProceedings of the 15th Annual Symposium on Logic in Computer Science Santa Barbara. IEEE Computer Society Press.
Department affiliated with
- Informatics Publications
Full text available