POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Pi-Nets: A Graphical Form of pi-Calculus
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Graph Notation for Concurrent Combinators
TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Non-deterministic interaction nets
Non-deterministic interaction nets
Call-by-need in token-passing nets
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Universal Hard Interaction for Clockless Computation: Dem Glücklichen schlägt keine Stunde!
Fundamenta Informaticae - Machines, Computations and Universality, Part II
An exact correspondence between a typed pi-calculus and polarised proof-nets
Theoretical Computer Science
Interpreting a finitary pi-calculus in differential interaction nets
Information and Computation
Functions as session-typed processes
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Universal Hard Interaction for Clockless Computation: Dem Glücklichen schlägt keine Stunde!
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Interpreting a finitary pi-calculus in differential interaction nets
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A hierarchy of expressiveness in concurrent interaction nets
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
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.