The following pages link to Mobile ambients (Q1575154):
Displaying 45 items.
- Secure Data Flow in a Calculus for Context Awareness (Q3507380) (← links)
- On Beta-Binders Communications (Q3507381) (← links)
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra (Q3507401) (← links)
- Mobile Ambients with Timers and Types (Q3525074) (← links)
- A Decentralized Implementation of Mobile Ambients (Q3540392) (← links)
- Network Applications of Graph Bisimulation (Q3540393) (← links)
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi (Q3541040) (← links)
- Automata on Multisets of Communicating Objects (Q3543347) (← links)
- Decidable Extensions of Hennessy-Milner Logic (Q3613068) (← links)
- Normal Bisimulations in Calculi with Passivation (Q3617734) (← links)
- Reactive Systems, Barbed Semantics, and the Mobile Ambients (Q3617735) (← links)
- Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication (Q3636840) (← links)
- Simple, Enhanced and Mutual Mobile Membranes (Q3642951) (← links)
- On Model Checking Boolean BI (Q3644756) (← links)
- Deciding reachability problems in Turing-complete fragments of Mobile Ambients (Q3655763) (← links)
- A Higher-Order Calculus of Computational Fields (Q4617982) (← links)
- A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST (Q4917051) (← links)
- On parameterization of higher-order processes (Q4976336) (← links)
- (Q5013871) (← links)
- Counting the Cost in the Picalculus (Extended Abstract) (Q5166616) (← links)
- Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding) (Q5170667) (← links)
- Decidable Fragments of a Higher Order Calculus with Locations (Q5170669) (← links)
- A Calculus for Mobile Ad-hoc Networks with Static Location Binding (Q5170671) (← links)
- Deciding Reachability in Mobile Ambients with Name Restriction (Q5179047) (← links)
- Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors (Q5179127) (← links)
- Reachability Analysis in BioAmbients (Q5179433) (← links)
- Control Flow Analysis of Generalised Boolean Networks (Q5404092) (← links)
- Stochastic Bigraphs (Q5415632) (← links)
- Modelling Intracellular Fate of FGF Receptors With BioAmbients (Q5415670) (← links)
- Multiple-Labelled Transition Systems for nominal calculi and their logics (Q5458061) (← links)
- Types for ambient and process mobility (Q5458067) (← links)
- Journeys in non-classical computation I: A grand challenge for computing research (Q5492115) (← links)
- Brane Calculi (Q5712404) (← links)
- RPO semantics for mobile ambients (Q5740373) (← links)
- Concurrency cannot be observed, asynchronously (Q5740646) (← links)
- A Global Occurrence Counting Analysis for Brane Calculi (Q5743592) (← links)
- Boxed ambients with communication interfaces (Q5756976) (← links)
- Applying a testing approach to the Calculus of Fair Ambients (Q5850754) (← links)
- (Q5875399) (← links)
- (Q5875401) (← links)
- Process calculi for biological processes (Q6062000) (← links)
- Modular rewritable Petri nets: an efficient model for dynamic distributed systems (Q6120343) (← links)
- The synchronized ambient calculus (Q6204540) (← links)
- Mixed choice in session types (Q6543263) (← links)
- Store locally, prove globally (Q6605367) (← links)
