Representing the Finite pi-calculus in Multi-Interaction Nets: Concurrency = Interaction + Non-determinism. Alexiev, V. Technical Report University of Alberta, April, 1998. Paper Citeseer abstract bibtex We extend the Interaction Nets of Lafont with some non-determinism capabilities and then show how to implement the finite monadic pi-calculus in that system

@TechReport{Alexiev1998-finitePi,
author = {Vladimir Alexiev},
title = {{Representing the Finite pi-calculus in Multi-Interaction Nets: Concurrency = Interaction + Non-determinism}},
institution = {University of Alberta},
year = 1998,
month = apr,
url = {http://rawgit2.com/VladimirAlexiev/my/master/pubs/Alexiev1998-finitePi.pdf},
url_CiteSeer = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.301.8381},
keywords = {pi-calculus, interaction nets, linear logic, concurrent computation,distributed computation},
abstract = {We extend the Interaction Nets of Lafont with some non-determinism capabilities and then show how to implement the finite monadic pi-calculus in that system},
}