Trust and partial typing in open systems of mobile agents
From MaRDI portal
Publication:1826471
DOI10.1023/B:JARS.0000021016.61054.3bzbMath1069.68076OpenAlexW1997968927MaRDI QIDQ1826471
James Riely, Matthew C. B. Hennessy
Publication date: 6 August 2004
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jars.0000021016.61054.3b
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Abstractions for fault-tolerant global computing ⋮ Boxed ambients with communication interfaces ⋮ Distributed processes and location failures ⋮ Typed ψ-calculi ⋮ Dynamic management of capabilities in a network aware coordination language ⋮ Typed behavioural equivalences for processes in the presence of subtyping ⋮ A categorical framework for typing CCS-style process communication ⋮ Types for access control ⋮ Resource access control in systems of mobile agents ⋮ Assigning types to processes ⋮ safeDpi: a language for controlling mobile code ⋮ Orderly communication in the ambient calculus.
This page was built for publication: Trust and partial typing in open systems of mobile agents