Towards a behavioural theory of access and mobility control in distributed systems

DOI10.1016/j.tcs.2003.12.024zbMath1071.68009OpenAlexW2122630589WikidataQ62041667 ScholiaQ62041667MaRDI QIDQ1881259

Julian Rathke, Massimo Merro, Matthew C. B. Hennessy

Publication date: 4 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.12.024

zbMATH Keywords

typed bisimulation equivalence

Mathematics Subject Classification ID

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

Related Items

Basic observables for a calculus for global computing ⋮ A theory for observational fault tolerance ⋮ Space-aware ambients and processes ⋮ Adding recursion to Dpi ⋮ A taxonomy of process calculi for distribution and mobility ⋮ A theory of system behaviour in the presence of node and link failure ⋮ Behavioural equivalences for dynamic web data ⋮ Boxed ambients with communication interfaces ⋮ Mobility control via passports ⋮ safeDpi: a language for controlling mobile code

Uses Software

• SafeDpi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus of mobile processes. II
• CONCUR '98. Concurrency theory. 9th international conference, Nice, France, September 8--11, 1998. Proceedings
• On reduction-based process semantics
• Mobile ambients
• Resource access control in systems of mobile agents
• Assigning types to processes
• Mobile objects as mobile processes
• Communication and mobility control in boxed ambients
• safeDpi: a language for controlling mobile code
• Typed behavioural equivalences for processes in the presence of subtyping
• Bisimulation congruences in safe ambients
• A calculus of mobile agents