A fully abstract trace model for dataflow networks
Number of Authors: 1
1988 (English)Report (Refereed)
A dataflow network consists of nodes that communicate over perfect FIFO channels. For dataflow networks containing only deterministic nodes, a simple and elegant semantic model has been presented by Kahn. However, for nondeterministic networks, the straight-forward generalization of Kahn's model is not compositional. We present a compositional model for nondeterministic networks, which is fully abstract, i.e., it has added the least amount of extra information to Kahn's model which is necessary for attaining compositionality. The model is based on traces.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1988, 1. , 25 p.
SICS Research Report, ISSN 0283-3638 ; R88:16
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-14381OAI: oai:DiVA.org:ri-14381DiVA: diva2:1035669
Earlier version appears in the Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, January 1989, pp. 155-65. Original report number R88016.2016-10-132016-10-13