Interpreting a finitary pi-calculus in differential interaction nets

Authors:
Thomas Ehrhard;Olivier Laurent
Affiliations:
Preuves, Programmes & Systemes, Universite Denis Diderot and CNRS;Preuves, Programmes & Systemes, Universite Denis Diderot and CNRS
Venue:
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Year:
2007

Citing 12
Cited 3

Linear logic

Theoretical Computer Science
From proof-nets to interaction nets

Proceedings of the workshop on Advances in linear logic
Domains and lambda-calculi

Domains and lambda-calculi
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
Concurrent Games and Full Completeness

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Solos in concert

Mathematical Structures in Computer Science
Ludics Nets, a game Model of Concurrent Interaction

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Finiteness spaces

Mathematical Structures in Computer Science
Multiport interaction nets and concurrency

CONCUR 2005 - Concurrency Theory
Concurrent nets: a study of prefixing in process calculi

Theoretical Computer Science - Expressiveness in concurrency
Asynchronous games 2: the true concurrency of innocence

Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Differential interaction nets

Theoretical Computer Science - Logic, language, information and computation

Differential Linear Logic and Polarization

TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Confluence of pure differential nets with promotion

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Proofs as executions

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose and study a translation of a pi-calculus without sums nor replication/recursion into an untyed and essentially promotion-free version of differential interaction nets. We define a transition system of labeled processes and a transition system of labeled differential interaction nets. We prove that our translation from processes to nets is a bisimulation between these two transition systems. This shows that differential interaction nets are suffieiently expressive for representing concurrency and mobility, as formalized by the pi-calculus.