ScholarLens Back to search
1988•Software Practice and ExperienceRequires access

CSP‐i: An implementation of communicating sequential processes

K. L. Wrench

Open publisher page 8 citations

Abstract

Abstract Hoare's proposal for a notation for communicating sequential processes has led to the development of a number of concurrent languages based on the concept of message passing. CSP‐i is a new language which reflects the design objectives of the original CSP notation more faithfully than most of these other languages. This paper describes the development of the language, as well as an implementation for a single processor, with simulated time‐slicing providing pseudo‐concurrency.

About this research paper

What this paper is about

Abstract Hoare's proposal for a notation for communicating sequential processes has led to the development of a number of concurrent languages based on the concept of message passing. CSP‐i is a new language which reflects the design objectives of the original CSP notation more faithfully than most of these other languages. This paper describes the development of the language, as well as an implementation for a single processor, with simulated time‐slicing providing pseudo‐concurrency.

Why it matters

OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract Hoare's proposal for a notation for communicating sequential processes has led to the development of a number of concurrent languages based on the concept of message passing. CSP‐i is a new language which reflects the design objectives of the original CSP notation more faithfully than most of these other languages. This paper describes the development of the language, as well as an implementation for a single processor, with simulated time‐slicing providing pseudo‐concurrency.

Key concepts: Communicating sequential processes, Computer science, Programming language, Concurrency, Notation, Slicing, Arithmetic, Semantics (computer science)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
CSP‐i: An implementation of communicating sequential processes — Research Paper | ScholarLens