Compiling process networks to interaction nets

Ian Mackie

doi:10.4204/EPTCS.225.3

Compiling process networks to interaction nets

Ian Mackie

École Polytechnique

Research output: Contribution to journal › Conference article › peer-review

Abstract

Kahn process networks are a model of computation based on a collection of sequential, deterministic processes that communicate by sending messages through unbounded channels. They are well suited for modelling stream-based computations, but are in no way restricted to this application. Interaction nets are graph rewriting systems that have many interesting properties for implementation. In this paper we show how to encode process networks using interaction nets, where we model both networks and messages in the same framework.

Original language	English
Pages (from-to)	5-14
Number of pages	10
Journal	Electronic Proceedings in Theoretical Computer Science, EPTCS
Volume	225
DOIs	https://doi.org/10.4204/EPTCS.225.3
Publication status	Published - 10 Sept 2016
Event	9th International Workshop on Computing with Terms and Graphs, TERMGRAPH 2016 - Eindhoven, Netherlands Duration: 8 Apr 2016 → …

Access to Document

10.4204/EPTCS.225.3

Cite this

@article{5b0e955b5da741348fd7d6966ca5ba42,

title = "Compiling process networks to interaction nets",

abstract = "Kahn process networks are a model of computation based on a collection of sequential, deterministic processes that communicate by sending messages through unbounded channels. They are well suited for modelling stream-based computations, but are in no way restricted to this application. Interaction nets are graph rewriting systems that have many interesting properties for implementation. In this paper we show how to encode process networks using interaction nets, where we model both networks and messages in the same framework.",

author = "Ian Mackie",

note = "Publisher Copyright: {\textcopyright} I. Mackie.; 9th International Workshop on Computing with Terms and Graphs, TERMGRAPH 2016 ; Conference date: 08-04-2016",

year = "2016",

month = sep,

day = "10",

doi = "10.4204/EPTCS.225.3",

language = "English",

volume = "225",

pages = "5--14",

journal = "Electronic Proceedings in Theoretical Computer Science, EPTCS",

issn = "2075-2180",

publisher = "Open Publishing Association",

}

TY - JOUR

T1 - Compiling process networks to interaction nets

AU - Mackie, Ian

N1 - Publisher Copyright: © I. Mackie.

PY - 2016/9/10

Y1 - 2016/9/10

N2 - Kahn process networks are a model of computation based on a collection of sequential, deterministic processes that communicate by sending messages through unbounded channels. They are well suited for modelling stream-based computations, but are in no way restricted to this application. Interaction nets are graph rewriting systems that have many interesting properties for implementation. In this paper we show how to encode process networks using interaction nets, where we model both networks and messages in the same framework.

AB - Kahn process networks are a model of computation based on a collection of sequential, deterministic processes that communicate by sending messages through unbounded channels. They are well suited for modelling stream-based computations, but are in no way restricted to this application. Interaction nets are graph rewriting systems that have many interesting properties for implementation. In this paper we show how to encode process networks using interaction nets, where we model both networks and messages in the same framework.

UR - https://www.scopus.com/pages/publications/85015888248

U2 - 10.4204/EPTCS.225.3

DO - 10.4204/EPTCS.225.3

M3 - Conference article

AN - SCOPUS:85015888248

SN - 2075-2180

VL - 225

SP - 5

EP - 14

JO - Electronic Proceedings in Theoretical Computer Science, EPTCS

JF - Electronic Proceedings in Theoretical Computer Science, EPTCS

T2 - 9th International Workshop on Computing with Terms and Graphs, TERMGRAPH 2016

Y2 - 8 April 2016

ER -

Compiling process networks to interaction nets

Abstract

Access to Document

Other files and links

Fingerprint

Cite this