Representing the Finite pi-calculus in Multi-Interaction Nets: Concurrency = Interaction + Non-determinism. Alexiev, V. Technical Report University of Alberta, April, 1998.
Representing the Finite pi-calculus in Multi-Interaction Nets: Concurrency = Interaction + Non-determinism [pdf]Paper  Representing the Finite pi-calculus in Multi-Interaction Nets: Concurrency = Interaction + Non-determinism [link]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

Downloads: 0