Interpreting a finitary pi-calculus in differential interaction nets

Authors:
Thomas Ehrhard;Olivier Laurent
Affiliations:
Preuves, Programmes et Systèmes, CNRS and Université Paris Diderot -- Paris 7, France;Laboratoire de l'Informatique du Parallélisme, Université de Lyon, ENS Lyon -- CNRS -- UCBL -- INRIA, France
Venue:
Information and Computation
Year:
2010

Citing 18
Cited 3

Linear logic

Theoretical Computer Science
The chemical abstract machine

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Combinatory representation of mobile processes

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From proof-nets to interaction nets

Proceedings of the workshop on Advances in linear logic
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
Bigraphs and transitions

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Solo Diagrams

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Geometry of interaction 2: deadlock-free algorithms

COLOG '88 Proceedings of the International Conference on Computer Logic
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
Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science)

Domains and Lambda-Calculi (Cambridge Tracts in Theoretical Computer Science)
An exact correspondence between a typed pi-calculus and polarised proof-nets

Theoretical Computer Science

Exponentials with infinite multiplicities

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Preface

Theoretical Computer Science
A hierarchy of expressiveness in concurrent interaction nets

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose and study a translation of a pi-calculus without sums nor recursion into an untyped 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 sufficiently expressive for representing concurrency and mobility, as formalized by the pi-calculus. Our study will concern essentially a replication-free fragment of the pi-calculus, but we shall also give indications on how to deal with a restricted form of replication.