Interpreting a finitary pi-calculus in differential interaction nets
From MaRDI portal
Publication:979075
DOI10.1016/j.ic.2009.06.005zbMath1205.68242MaRDI QIDQ979075
Olivier Laurent, Thomas Ehrhard
Publication date: 25 June 2010
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2009.06.005
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
The true concurrency of differential interaction nets, Jump from parallel to sequential proofs: exponentials, Relating reasoning methodologies in linear logic and process algebra, Visible acyclic differential nets. I: Semantics, Preface to the special volume, An interpretation of CCS into ludics, A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus, Observed Communication Semantics for Classical Processes, Conflation Confers Concurrency
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approach to innocent strategies as graphs
- Linear logic
- Strong normalisation in the \(\pi\)-calculus
- Differential interaction nets
- An exact correspondence between a typed pi-calculus and polarised proof-nets
- Normal functors, power series and \(\lambda\)-calculus
- The chemical abstract machine
- The structure of multiplicatives
- Completeness results for linear logic on Petri nets
- Concurrent nets: a study of prefixing in process calculi
- Asynchronous games. II: The true concurrency of innocence
- Acyclic Solos and Differential Interaction Nets
- Bigraphs and transitions
- Descriptive and Relative Completeness of Logics for Higher-Order Functions
- Not Enough Points Is Enough
- A Powerdomain Construction
- Finiteness spaces
- CONCUR 2005 – Concurrency Theory
