Deriving structural labelled transitions for mobile ambients

DOI10.1016/j.ic.2010.06.001zbMath1214.68251OpenAlexW4236516632MaRDI QIDQ1959484

Paweł Sobociński, Julian Rathke

Publication date: 7 October 2010

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

Full work available at URL: https://eprints.soton.ac.uk/266825/1/concurFinal.pdf

zbMATH Keywords

bisimulationlabelled transition systemsambient calculusstructural operational semantics (sos)

Mathematics Subject Classification ID

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

Related Items (2)

RPO semantics for mobile ambients ⋮ Relational presheaves, change of base and weak simulation

Uses Software

• GcPan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fair ambients
• An efficient abstract machine for safe ambients
• Algebra of communicating processes with abstraction
• A calculus of communicating systems
• A calculus of mobile processes. II
• On bisimulations for the asynchronous \(\pi\)-calculus
• Mobile ambients
• A structural approach to operational semantics
• Bigraphs and transitions
• Behavioral theory for mobile ambients
• Deriving Structural Labelled Transitions for Mobile Ambients
• Reactive Systems, Barbed Semantics, and the Mobile Ambients
• Equational properties of mobile ambients
• Making the Unobservable, Unobservable
• Boxed ambients with communication interfaces
• Semantic Barbs and Biorthogonality
• From rewrite rules to bisimulation congruences

This page was built for publication: Deriving structural labelled transitions for mobile ambients