On asynchrony in name-passing calculi

DOI10.1017/S0960129504004323zbMath1093.68026MaRDI 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

68Q55: Semantics in the theory of computing

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

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

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