The following pages link to A calculus of mobile agents (Q6104384):
Displaying 50 items.
- On the diversity of asynchronous communication (Q315311) (← links)
- Ambient abstract state machines with applications (Q439957) (← links)
- Theory of interaction (Q896903) (← links)
- A theory of system behaviour in the presence of node and link failure (Q939442) (← links)
- Pict correctness revisited (Q1004056) (← links)
- Asynchronous sequential processes (Q1013090) (← links)
- Dynamic management of capabilities in a network aware coordination language (Q1035673) (← links)
- Stabilizing mobile philosophers (Q1041771) (← links)
- A process algebra with distributed priorities (Q1276244) (← links)
- On transformations of concurrent-object programs (Q1276245) (← links)
- Non-interleaving semantics for mobile processes (Q1285660) (← links)
- Basic observables for processes (Q1286368) (← links)
- Inheritance in the join calculus. (Q1426056) (← links)
- Continuation-based transformations for coordination languages (Q1575149) (← links)
- On modelling mobility (Q1575151) (← links)
- Mobile ambients (Q1575154) (← links)
- Types for access control (Q1575157) (← links)
- Dynamic connectors for concurrency (Q1603689) (← links)
- A calculus for reasoning about software composition (Q1770365) (← links)
- A coordination approach to mobile components (Q1770368) (← links)
- An object based algebra for specifying a fault tolerant software architecture (Q1779322) (← links)
- Observational congruences for dynamically reconfigurable tile systems (Q1782000) (← links)
- Causality for debugging mobile agents (Q1806172) (← links)
- Resource access control in systems of mobile agents (Q1854507) (← links)
- Assigning types to processes (Q1854525) (← links)
- Language-based performance prediction for distributed and mobile systems (Q1854534) (← links)
- Orderly communication in the ambient calculus. (Q1869977) (← links)
- Abstractions for fault-tolerant global computing (Q1881258) (← links)
- Towards a behavioural theory of access and mobility control in distributed systems (Q1881259) (← links)
- A theory of bisimulation for a fragment of concurrent ML with local names (Q1882896) (← links)
- On distributability (Q2123059) (← links)
- A formal approach to the engineering of domain-specific distributed systems (Q2291825) (← links)
- Coordinating mobile agents in interaction spaces (Q2373648) (← links)
- Basic observables for a calculus for global computing (Q2384924) (← links)
- Full abstraction for polymorphic \(\pi \)-calculus (Q2474052) (← links)
- Modeling mobile agent behavior (Q2475885) (← links)
- Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus (Q2566037) (← links)
- The seal calculus (Q2566220) (← links)
- Dynamic input/output automata: a formal and compositional model for dynamic systems (Q2629850) (← links)
- Typed behavioural equivalences for processes in the presence of subtyping (Q2841263) (← links)
- On Mobility and Communication (Q2994477) (← links)
- Mobile Agents Implementing Local Computations in Graphs (Q3540391) (← links)
- Distributed processes and location failures (Q4571978) (← links)
- Basic observables for processes (Q4571979) (← links)
- (Q4738174) (← links)
- The Two-Phase Commitment Protocol in an Extended π-Calculus (Q4917025) (← links)
- On the decidability of fragments of the asynchronous π-calculus (Q4917084) (← links)
- Formal Methods for Components and Objects (Q5897131) (← links)
- Bisimulations in the join-calculus (Q5958770) (← links)
- A model of actors and grey failures (Q6137831) (← links)
