Resource access control in systems of mobile agents

DOI10.1006/inco.2001.3089zbMath1009.68081OpenAlexW2004048608MaRDI QIDQ1854507

James Riely, Matthew C. B. Hennessy

Publication date: 14 January 2003

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

Full work available at URL: https://doi.org/10.1006/inco.2001.3089

Mathematics Subject Classification ID

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

Related Items (48)

Towards a behavioural theory of access and mobility control in distributed systems ⋮ Network Conscious π-calculus: A Concurrent Semantics ⋮ Types and full abstraction for polyadic \(\pi\)-calculus ⋮ A theory for observational fault tolerance ⋮ Name-passing calculi: from fusions to preorders and types ⋮ Space-aware ambients and processes ⋮ Adding recursion to Dpi ⋮ Unnamed Item ⋮ Towards a unified approach to encodability and separation results for process calculi ⋮ Unnamed Item ⋮ Towards a Unified Approach to Encodability and Separation Results for Process Calculi ⋮ Role-based access control for boxed ambients ⋮ Semantic subtyping for the pi-calculus ⋮ A taxonomy of process calculi for distribution and mobility ⋮ Spatial-behavioral types for concurrency and resource control in distributed systems ⋮ Security types for dynamic web data ⋮ A theory of system behaviour in the presence of node and link failure ⋮ Types for Role-Based Access Control of Dynamic Web Data ⋮ Behavioural equivalences for dynamic web data ⋮ Full abstraction for polymorphic \(\pi \)-calculus ⋮ Symmetric electoral systems for ambient calculi ⋮ The \(C_\pi\)-calculus: a model for confidential name passing ⋮ A network-conscious \(\pi\)-calculus and its coalgebraic semantics ⋮ Network-conscious \(\pi\)-calculus -- a model of Pastry ⋮ From flow logic to static type systems for coordination languages ⋮ On the expressive power of \textsc{Klaim}-based calculi ⋮ Name-passing in an ambient-like calculus and its proof using spatial logic ⋮ The security pi-calculus and non-interference ⋮ Boxed ambients with communication interfaces ⋮ Event based choreography ⋮ Spatial-Behavioral Types, Distributed Services, and Resources ⋮ Security Types for Dynamic Web Data ⋮ Multiple-Labelled Transition Systems for nominal calculi and their logics ⋮ Types for ambient and process mobility ⋮ On the Relative Expressive Power of Calculi for Mobility ⋮ A formal approach to the engineering of domain-specific distributed systems ⋮ A type system for Discretionary Access Control ⋮ Dynamics of reputation in mobile agents systems and weighted timed automata ⋮ Dynamic management of capabilities in a network aware coordination language ⋮ Typed behavioural equivalences for processes in the presence of subtyping ⋮ Modelling dynamic web data ⋮ The seal calculus ⋮ Dynamic structural operational semantics ⋮ Assigning types to processes ⋮ safeDpi: a language for controlling mobile code ⋮ Interaction in Time and Space ⋮ Co-Algebraic Models for Quantitative Spatial Logics ⋮ Towards an algebraic theory of typed mobile processes

Uses Software

• KLAIM
• Aglets
• Voyager

Cites Work

• A calculus of mobile processes. II
• Mobile ambients
• Trust and partial typing in open systems of mobile agents
• Implicit typing à la ML for the join-calculus
• A calculus of mobile agents
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Resource access control in systems of mobile agents