A fully abstract trace model for dataflow and asynchronous networks | Zendy

Bengt Jönsson | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A fully abstract trace model for dataflow and asynchronous networks

Author(s) -

Bengt Jönsson

Publication year - 1994

Publication title -

distributed computing

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.707

H-Index - 48

eISSN - 1432-0452

pISSN - 0178-2770

DOI - 10.1007/bf02280834

Subject(s) - nondeterministic algorithm , dataflow , computer science , principle of compositionality , fifo (computing and electronics) , asynchronous communication , trace (psycholinguistics) , simple (philosophy) , theoretical computer science , generalization , distributed computing , parallel computing , programming language , computer network , mathematics , artificial intelligence , mathematical analysis , linguistics , philosophy , epistemology

Summary A dataflow network consists of nodes that communicate over perfect unbounded 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 that is fully abstract i.e., it has added the least amount of extra information to Kahn's model that is necessary for attaining compositionality. The model is based on traces. We also generalize our result, showing that the model is fully abstract also for classes of networks where nodes communicate over other types of asynchronous channels. Examples of such classes are networks with unordered channels, and networks with lossy channels.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research