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

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.

[1]  Zohar Manna,et al.  Reasoning in Interval Temporal Logic , 1983, Logic of Programs.

[2]  A. W. Roscoe,et al.  A Timed Model for Communicating Sequential Processes , 1986, Theor. Comput. Sci..

[3]  Ernst-Rüdiger Olderog,et al.  Process Theory: Semantics, Specification and Verification , 1986, Current Trends in Concurrency.

[4]  Georges Louis,et al.  An Analytical Description of CHILL, the CCITT High Level Language , 1982, Lecture Notes in Computer Science.

[5]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[6]  Amir Pnueli,et al.  Linear and Branching Structures in the Semantics and Logics of Reactive Systems , 1985, ICALP.

[7]  Juris Hartmanis,et al.  The Programming Language Ada , 1983, Lecture Notes in Computer Science.

[8]  Leslie Lamport,et al.  Specifying Concurrent Program Modules , 1983, TOPL.

[9]  Gordon Plotkin,et al.  An Operational Semantics for CSP. , 1982 .

[10]  J. W. de Bakker,et al.  Mathematical theory of program correctness , 1980, Prentice-Hall international series in computer science.

[11]  Arthur J. Bernstein,et al.  Proving real-time properties of programs with temporal logic , 1981, SOSP.

[12]  Willem P. de Roever,et al.  Real-time programming and asynchronous message passing , 1983, PODC '83.

[13]  Willem P. de Roever,et al.  Examples of a Real-Time Temporal Logic Specification , 1983, The Analysis of Concurrent Systems.

[14]  S. J. Young,et al.  The programming language ADA reference manual: Springer-Verlag (1981) pp 243, $7.90, DM 16.50 , 1982, Microprocess. Microsystems.

[15]  M N Wegman.  What it's like to be a POPL referee; or how to write an extended abstract so that it is more likely to be accepted , 1986, SIGP.

[16]  Willem P. de Roever,et al.  Compositional Semantics for Real-Time Distributed Computing , 1985, Inf. Comput..

[17]  Gérard Berry,et al.  The ESTEREL Synchronous Programming Language and its Mathematical Semantics , 1984, Seminar on Concurrency.

[18]  Amir Pnueli,et al.  A really abstract concurrent model and its temporal logic , 1986, POPL '86.

[19]  Matthew Hennessy,et al.  Full Abstraction for a Simple Parallel Programming Language , 1979, MFCS.

[20]  Joseph Y. Halpern,et al.  Optimal precision in the presence of uncertainty , 1985, STOC '85.

[21]  Manfred Broy,et al.  Applicative Real-Time Programming , 1983, IFIP Congress.

[22]  Joseph Y. Halpern,et al.  Optimal precision in the presence of uncertainty , 1985, J. Complex..

[23]  Amir Pnueli,et al.  A Linear-History Semantics for Languages for Distributed Programming , 1984, Theor. Comput. Sci..

[24]  Nicolas Halbwachs,et al.  Outline of a Real Time Data Flow Language , 1985, RTSS.