The denotational semantics of dynamic networks of processes-Reference-Cited by-同舟云学术

The denotational semantics of dynamic networks of processes

Published:1985-10 Issue:4 Volume:7 Page:656-679
ISSN:0164-0925
Container-title:ACM Transactions on Programming Languages and Systems
language:en
Short-container-title:ACM Trans. Program. Lang. Syst.

Author:

de Bruin Arie¹,Böhm Wim²

Affiliation:

1. Erasmus Univ., Rotterdam, The Netherlands

2. Univ. of Utrecht, Utrecht, The Netherlands

Abstract

DNP (dynamic networks of processes) is a variant of the language introduced by Kahn and MacQueen [11, 12]. In the language it is possible to create new processes dynamically. We present a complete, formal denotational semantics for the language, along the lines sketched by Kahn and MacQueen. An informal explanation of the formal semantics is also given.

Publisher

Association for Computing Machinery (ACM)

Subject

Software

Link

https://dl.acm.org/doi/pdf/10.1145/4472.4473

Reference19 articles.

1. APT K.R. Recursive assertions and parallel programs. Acta In{. 15 (1981) 219-232. APT K.R. Recursive assertions and parallel programs. Acta In{. 15 (1981) 219-232.

2. Processes and the denotational semantics of concurrency

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Continuation Semantics for Asynchronous Concurrency;Fundamenta Informaticae;2014

2. Linear dynamic Kahn networks are deterministic;Theoretical Computer Science;1998-03

3. Expressing requirements on a parallel system formally;Requirements Engineering;1996-12

4. Linear dynamic Kahn networks are deterministic;Mathematical Foundations of Computer Science 1996;1996

5. Parallele Programmiersprachen;Parallelrechner;1995