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

Authors:
C. Huizing;R. Gerth;W. P. deRoever
Affiliations:
Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Year:
1987

Citing 15
Cited 3

A linear-history semantics for languages for distributed programming

Theoretical Computer Science
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

ACM SIGPLAN Notices
A timed model for communicating sequential processes

International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Specification-oriented semantics for communicating processes

Acta Informatica
Process theory: semantics, specification and verification

Current trends in concurrency. Overviews and tutorials
Specifying Concurrent Program Modules

ACM Transactions on Programming Languages and Systems (TOPLAS)
A really abstract concurrent model and its temporal logic

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Mathematical Theory of Program Correctness

Mathematical Theory of Program Correctness
An Analytical Description of Chill, the CCITT High Level Language

An Analytical Description of Chill, the CCITT High Level Language
Linear and Branching Structures in the Semantics and Logics of Reactive Systems

Proceedings of the 12th Colloquium on Automata, Languages and Programming
The ESTEREL Synchronous Programming Language and its Mathematical Semantics

Seminar on Concurrency, Carnegie-Mellon University
Examples of a Real-Time Temporal Logic Specification

The Analysis of Concurrent Systems
Reasoning in Interval Temporal Logic

Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Proving real-time properties of programs with temporal logic

SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
Real-time programming and asynchronous message passing

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing

Functional specification of time-sensitive communicating systems

ACM Transactions on Software Engineering and Methodology (TOSEM)
On Timed Models and Full Abstraction

Electronic Notes in Theoretical Computer Science (ENTCS)
RT-CDL: A distributed real-time design language and its operational semantics

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

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.