Concurrent Processes and Their Syntax
Journal of the ACM (JACM)
Communicating sequential processes
Communications of the ACM
Verifying properties of parallel programs: an axiomatic approach
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Mathematical Theory of Program Correctness
Mathematical Theory of Program Correctness
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
A Discipline of Programming
Semantics of Unbounded Nondeterminism
Proceedings of the 7th Colloquium on Automata, Languages and Programming
A Cook's Tour of Countable Nondeterminism
Proceedings of the 8th Colloquium on Automata, Languages and Programming
On the Semantics of Fair Parallelism
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
Countable nondeterminism and random assignment
Journal of the ACM (JACM)
Transition systems, infinitary languages and the semantics of uniform concurrency
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Abstract computability and algebraic specification
ACM Transactions on Computational Logic (TOCL)
Liveness properties as convergence in metric spaces
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A survey of semantic description frameworks for programming languages
ACM SIGPLAN Notices
A brief history of process algebra
Theoretical Computer Science - Process algebra
A semantic model for graphical user interfaces
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Building connections between theories of computing and physical systems
Proceedings of the 2013 ACM international symposium on New ideas, new paradigms, and reflections on programming & software
| Hi-index | 0.00 |
A general framework for the denotational treatment of concurrency is introduced. The key idea is the notion of process which is element of a domain obtained as solution of a domain equation in the style as considered previously by Plotkin. We use tools from metric topology as advocated by Nivat to solve this equation, show how operations upon processes can be defined conveniently, and illustrate the approach with the definition of a variety of concepts as encountered in the study of concurrency. Only few proofs of the supporting mathematical theory are given; full proofs will appear in the final version of the paper.