Full abstraction of a real-time denotational semantics for an OCCAM-like language

1 January 1987

proceedings article
Published by Association for Computing Machinery (ACM)

p. 223-236
https://doi.org/10.1145/41625.41645

Abstract

We present a fully abstract semantics for real-time distributed computing of the Ada and OCCAM kind in a denotational style. This semantics turns termination, communication along channels, and the time communication takes place, into observables. Yet it is the coarsest semantics to do so which is syntax-directed (this is known as full abstraction). It extends the linear history semantics for CSP of Francez, Lehman and Pnueli. Our execution model is based on maximizing concurrent activity as opposed to interleaving (in which only one action occurs at the time and arbitrary delays are incurred between actions). It is a variant of the maximal parallelism model of Salwicki and Müldner.

Keywords

This publication has 0 references indexed in Scilit: