Adding recursion to Dpi

DOI10.1016/J.TCS.2006.12.017zbMath1111.68083OpenAlexW2141216727MaRDI QIDQ877023

Samuel Hym, Matthew C. B. Hennessy

Publication date: 19 April 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.12.017

zbMATH Keywords

recursionDpi-calculusimplementation using replicationrecursive and co-inductive types

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Using bisimulation proof techniques for the analysis of distributed abstract machines ⋮ Mobility control via passports

Cites Work

• Unnamed Item
• Unnamed Item
• Resource access control in systems of mobile agents
• Towards a behavioural theory of access and mobility control in distributed systems
• A theory of bisimulation for a fragment of concurrent ML with local names
• Recursive subtyping revealed
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Adding recursion to Dpi