The following pages link to Mobile ambients (Q1575154):
Displaying 50 items.
- Dynamic management of capabilities in a network aware coordination language (Q1035673) (← links)
- LMNtal as a hierarchical logic programming language (Q1035709) (← links)
- Continuation-based transformations for coordination languages (Q1575149) (← links)
- On modelling mobility (Q1575151) (← links)
- Types for access control (Q1575157) (← links)
- Computing with membranes (Q1582013) (← links)
- Names of the \(\pi\)-calculus agents handled locally (Q1589648) (← links)
- Dynamic connectors for concurrency (Q1603689) (← links)
- Typing evolving ambients (Q1607130) (← links)
- Hierarchical graph transformation (Q1608318) (← links)
- A UTP approach for rTiMo (Q1624596) (← links)
- On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus (Q1641151) (← links)
- A semantic theory of the Internet of things (Q1706144) (← links)
- A monotone framework for CCS (Q1749243) (← links)
- On the computational strength of pure ambient calculi (Q1763730) (← links)
- A coordination approach to mobile components (Q1770368) (← links)
- When ambients cannot be opened (Q1770415) (← links)
- A brief history of process algebra (Q1781995) (← links)
- Static analysis for the \(\pi\)-calculus with applications to security (Q1854437) (← links)
- Resource access control in systems of mobile agents (Q1854507) (← links)
- A performance-based methodology to early evaluate the effectiveness of mobile software architectures (Q1858429) (← links)
- On the expressive power of movement and restriction in pure mobile ambients (Q1881256) (← links)
- Abstractions for fault-tolerant global computing (Q1881258) (← links)
- Towards a behavioural theory of access and mobility control in distributed systems (Q1881259) (← links)
- Tau laws for pi calculus (Q1884877) (← links)
- Model checking mobile ambients (Q1884885) (← links)
- Nesting analysis of mobile ambients (Q1886451) (← links)
- On abstract interpretation of mobile ambients (Q1887169) (← links)
- Towards a unified approach to encodability and separation results for process calculi (Q1959439) (← links)
- Deriving structural labelled transitions for mobile ambients (Q1959484) (← links)
- On the concurrent computational content of intermediate logics (Q1989344) (← links)
- A probabilistic calculus of cyber-physical systems (Q2042728) (← links)
- On primitives for compensation handling as adaptable processes (Q2043807) (← links)
- A process algebraic approach to reaction systems (Q2044947) (← links)
- Bialgebraic foundations for the operational semantics of string diagrams (Q2051792) (← links)
- A thesis for interaction (Q2055962) (← links)
- Modelling of DNA mismatch repair with a reversible process calculus (Q2148904) (← links)
- Replacement freeness: a criterion for separating process calculi (Q2210864) (← links)
- The \texttt{link}-calculus for open multiparty interactions (Q2216110) (← links)
- Distributability of mobile ambients (Q2216122) (← links)
- A control flow analysis for Beta-binders with and without static compartments (Q2271446) (← links)
- A formal approach to the engineering of domain-specific distributed systems (Q2291825) (← links)
- Dynamic structural operational semantics (Q2329443) (← links)
- Models and emerging trends of concurrent constraint programming (Q2348541) (← links)
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs (Q2348797) (← links)
- What is a free name in a process algebra? (Q2379969) (← links)
- Basic observables for a calculus for global computing (Q2384924) (← links)
- Linear forwarders (Q2384926) (← links)
- On subexponentials, focusing and modalities in concurrent systems (Q2404074) (← links)
- A static analysis for brane calculi providing global occurrence counting information (Q2405890) (← links)
