Skip to main content
Conference Proceedings

Multiport interaction nets and concurrency

Lecture Notes in Computer Science (2005) 3653 21-35
DOI: 10.1007/11539452_6
15Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider an extension of Lafont's Interaction Nets, called Multiport Interaction Nets, and show that they are a model of concurrent computation by encoding the full π-calculus in them. We thus obtain a faithful graphical representation of the π-calculus in which every reduction step is decomposed in fully local graph-rewriting rules. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Mazza, D. (2005). Multiport interaction nets and concurrency. In Lecture Notes in Computer Science (Vol. 3653, pp. 21–35). Springer Verlag. https://doi.org/10.1007/11539452_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free