Name-passing calculi: from fusions to preorders and types

DOI10.1016/j.ic.2016.10.003zbMath1353.68206OpenAlexW2535086089MaRDI QIDQ342734

Jean-Marie Madiot, Daniel Hirschkoff, Davide Sangiorgi

Publication date: 18 November 2016

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2016.10.003

zbMATH Keywords

behavioural equivalenceexpressivenesstype systemsubtypingprocess calculus

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• A behavioural theory for a \(\pi\)-calculus with preorders
• Semantic subtyping for the pi-calculus
• Testing equivalences for processes
• On reduction-based process semantics
• Resource access control in systems of mobile agents
• A presheaf environment for the explicit fusion calculus
• Explicit fusions
• Types for Resources in $$\psi $$-calculi
• Typed ψ-calculi
• A Distributed Pi-Calculus
• On asynchrony in name-passing calculi
• Barbed bisimulation
• Name-Passing Calculi: From Fusions to Preorders and Types
• Trustworthy Global Computing
• Algebra and Coalgebra in Computer Science
• A New Type System for Deadlock-Free Processes
• Formal Methods at the Crossroads. From Panacea to Foundational Support