We introduce a geometry of interaction model for Mazza's multiport interaction combinators, a graph-theoretic formalism which is able to faithfully capture concurrent computation as embodied by process algebras like the Ï-calculus. The introduced model is based on token machines in which not one but multiple tokens are allowed to traverse the underlying net at the same time. We prove soundness and adequacy of the introduced model. The former is proved as a simulation result between the token machines one obtains along any reduction sequence. The latter is obtained by a fine analysis of convergence, both in nets and in token machines.
The geometry of concurrent interaction: Handling multiple ports by way of multiple tokens / Dal Lago, Ugo; Tanaka, Ryo; Yoshimizu, Akira. - ELETTRONICO. - (2017), pp. 8005112.1-8005112.12. (Intervento presentato al convegno 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017 tenutosi a Reykjavik, Iceland nel 2017) [10.1109/LICS.2017.8005112].
The geometry of concurrent interaction: Handling multiple ports by way of multiple tokens
Dal Lago, Ugo
;
2017
Abstract
We introduce a geometry of interaction model for Mazza's multiport interaction combinators, a graph-theoretic formalism which is able to faithfully capture concurrent computation as embodied by process algebras like the Ï-calculus. The introduced model is based on token machines in which not one but multiple tokens are allowed to traverse the underlying net at the same time. We prove soundness and adequacy of the introduced model. The former is proved as a simulation result between the token machines one obtains along any reduction sequence. The latter is obtained by a fine analysis of convergence, both in nets and in token machines.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
