A theory for nondeterminism, parallelism, communication, and concurrency (Q1081296)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A theory for nondeterminism, parallelism, communication, and concurrency |
scientific article |
Statements
A theory for nondeterminism, parallelism, communication, and concurrency (English)
0 references
1986
0 references
An applicative language is introduced for representing concurrent programs and communicating systems in the form of mutually recursive systems of nondeterministic equations for functions and streams. Mathematical semantics is defined by associating particular fixed points with such systems. These fixed points are chosen using a combination of several complete partial orderings. Operational semantics is described in the form of term rewriting rules, consistent with the mathematical semantics. It represents data-driven reduction semantics for usual expressions and data-driven data flow semantics in the case of recursive stream equations. So the language allows to treat the basic semantic notions of nondeterminism, parallelism, communication, and concurrency for multiprogramming in a completely formal, applicative framework. In particular, it provides a semantic theory for networks of loosely coupled, nondeterministic, communicating, stream processing functions. Finally, the relationship of the presented language to partial recursive functions and nonconventional models such as data flow and reduction machines is shown.
0 references
concurrent programs
0 references
communicating systems
0 references
mutually recursive systems of nondeterministic equations
0 references
fixed points
0 references
Operational semantics
0 references
rewriting rules
0 references
data flow semantics
0 references
recursive stream equations
0 references
multiprogramming
0 references
stream processing functions
0 references
partial recursive functions
0 references
reduction machines
0 references