Bisimulation congruences in safe ambients

DOI10.1145/503272.503280zbMath1323.68412OpenAlexW2095421079MaRDI QIDQ5178899

Massimo Merro, Matthew C. B. Hennessy

Publication date: 17 March 2015

Published in: Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/503272.503280

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (23)

Towards a behavioural theory of access and mobility control in distributed systems ⋮ A coalgebraic approach to the semantics of the ambient calculus ⋮ Space-aware ambients and processes ⋮ Fair ambients ⋮ An efficient abstract machine for safe ambients ⋮ A pure labeled transition semantics for the applied pi calculus ⋮ Parameterizing higher-order processes on names and processes ⋮ Access control in mobile ambient calculi: a comparative view ⋮ Unnamed Item ⋮ On the computational strength of pure ambient calculi ⋮ Pure bigraphs: structure and dynamics ⋮ A typed encoding of boxed into safe ambients ⋮ A coordination approach to mobile components ⋮ Name-passing in an ambient-like calculus and its proof using spatial logic ⋮ Leader election in rings of ambient processes ⋮ Locating reaction with 2-categories ⋮ Types for ambient and process mobility ⋮ Probabilistic mobile ambients ⋮ Deciding reachability problems in Turing-complete fragments of Mobile Ambients ⋮ The seal calculus ⋮ Applying a testing approach to the Calculus of Fair Ambients ⋮ safeDpi: a language for controlling mobile code ⋮ Bisimulation and Co-induction: Some Problems

This page was built for publication: Bisimulation congruences in safe ambients