On asynchrony in name-passing calculi

DOI10.1017/S0960129504004323zbMath1093.68026OpenAlexW1966949854MaRDI QIDQ4653019

Massimo Merro, Davide Sangiorgi

Publication date: 28 February 2005

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129504004323

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (19)

Eager functions as processes ⋮ On distributability ⋮ Name-passing calculi: from fusions to preorders and types ⋮ Coupled similarity: the first 32 years ⋮ Theory of interaction ⋮ Unnamed Item ⋮ Channel abstractions for network security ⋮ The \(C_\pi\)-calculus: a model for confidential name passing ⋮ Responsiveness in process calculi ⋮ Security Abstractions and Intruder Models (Extended Abstract) ⋮ On the observational theory of the CPS-calculus ⋮ Linear logic propositions as session types ⋮ Full abstraction for expressiveness: history, myths and facts ⋮ On the interactive power of higher-order processes extended with parameterization ⋮ A formal approach to the engineering of domain-specific distributed systems ⋮ The λ-calculus in the π-calculus ⋮ FROM COMPUTING TO INTERACTION: ON THE EXPRESSIVENESS OF ASYNCHRONOUS PI-CALCULUS ⋮ Matching Systems for Concurrent Calculi ⋮ Propositions as sessions

This page was built for publication: On asynchrony in name-passing calculi