Mobile ambients
From MaRDI portal
Publication:1575154
DOI10.1016/S0304-3975(99)00231-5zbMath0954.68108OpenAlexW2912003593WikidataQ56982145 ScholiaQ56982145MaRDI QIDQ1575154
Luca Cardelli, Andrew D. Gordon
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00231-5
Related Items
Coalgebraic Symbolic Semantics, Dynamic input/output automata: a formal and compositional model for dynamic systems, Formal Modeling of Mobile Computing Systems Based on Ambient Abstract State Machines, Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs, Howe’s Method for Calculi with Passivation, A Petri net model for membrane systems with dynamic structure, 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 Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA)., A General Theory of Barbs, Contexts, and Labels, Process calculi for biological processes, Functional choreographic programming, Combining Intra- and Inter-cellular Dynamics to Investigate Intestinal Homeostasis, Modular rewritable Petri nets: an efficient model for dynamic distributed systems, Secure Data Flow in a Calculus for Context Awareness, On Beta-Binders Communications, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, Unnamed Item, Unnamed Item, On a higher-order calculus of computational fields, The synchronized ambient calculus, Unnamed Item, Unnamed Item, A Higher-Order Calculus of Computational Fields, Unnamed Item, A Decentralized Implementation of Mobile Ambients, Network Applications of Graph Bisimulation, Towards a Unified Approach to Encodability and Separation Results for Process Calculi, Automata on Multisets of Communicating Objects, On Mobility and Communication, A semantic framework for open processes, Tutorial on separation results in process calculi via leader election problems, Brane Calculi, Control Flow Analysis of Generalised Boolean Networks, CCS with priority guards, Symmetric electoral systems for ambient calculi, Unnamed Item, Stochastic Bigraphs, Modelling Intracellular Fate of FGF Receptors With BioAmbients, Counting the Cost in the Picalculus (Extended Abstract), Information flow security in boundary ambients, Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding), Decidable Fragments of a Higher Order Calculus with Locations, A Calculus for Mobile Ad-hoc Networks with Static Location Binding, Unnamed Item, RPO semantics for mobile ambients, Concurrency cannot be observed, asynchronously, A Global Occurrence Counting Analysis for Brane Calculi, Deciding Reachability in Mobile Ambients with Name Restriction, Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors, A typed encoding of boxed into safe ambients, Reachability Analysis in BioAmbients, On the expressive power of \textsc{Klaim}-based calculi, A CPS encoding of name-passing in higher-order mobile embedded resources, Name-passing in an ambient-like calculus and its proof using spatial logic, Leader election in rings of ambient processes, Types for the ambient calculus, Boxed ambients with communication interfaces, Decidable Extensions of Hennessy-Milner Logic, On the Expressiveness of the π-Calculus and the Mobile Ambients, Normal Bisimulations in Calculi with Passivation, Reactive Systems, Barbed Semantics, and the Mobile Ambients, 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, Hunting Distributed Malware with the κ-Calculus, Unnamed Item, Typed ψ-calculi, Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication, On parameterization of higher-order processes, Simple, Enhanced and Mutual Mobile Membranes, On Model Checking Boolean BI, Non-disclosure for distributed mobile code, Journeys in non-classical computation I: A grand challenge for computing research, Deciding reachability problems in Turing-complete fragments of Mobile Ambients, On the Expressive Power of Polyadic Synchronisation in π-calculus, The seal calculus, Applying a testing approach to the Calculus of Fair Ambients, On an open problem of Amadio and Curien: The finite antichain condition, On the expressiveness of π-calculus for encoding mobile ambients, safeDpi: a language for controlling mobile code, Structuring Operational Semantics: Simplification and Computation, Translating Mobile Ambients into P Systems, On Reachability and Spatial Reachability in Fragments of BioAmbients, A Simple Calculus for Proteins and Cells, A Model in κ for DNA Addition, Virtual Organizations in Arigatoni, Matching Systems for Concurrent Calculi, Interaction in Time and Space, Active Evaluation Contexts for Reaction Semantics, Synchrony vs Asynchrony in Communication Primitives, Extensionality of Spatial Observations in Distributed Systems, Modelling Calculi with Name Mobility using Graphs with Equivalences, Expressiveness Issues in Brane Calculi: A Survey, Encoding Distributed Process Calculi into LMNtal, Describing the Immune System Using Enhanced Mobile Membranes, A Static Analysis for Beta-Binders, Specification and refinement of mobile systems in MTLA and mobile UML, On the expressive power of movement and restriction in pure mobile ambients, Abstractions for fault-tolerant global computing, Towards a behavioural theory of access and mobility control in distributed systems, A UTP approach for rTiMo, Tau laws for pi calculus, Model checking mobile ambients, Nesting analysis of mobile ambients, On abstract interpretation of mobile ambients, PiDuce- A project for experimenting web services technologies, Reactive systems, (semi-)saturated semantics and coalgebras on presheaves, An exercise in structural congruence, What is a free name in a process algebra?, On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus, Modelling of DNA mismatch repair with a reversible process calculus, Basic observables for a calculus for global computing, Linear forwarders, A coalgebraic approach to the semantics of the ambient calculus, A framework for security analysis of mobile wireless networks, A core calculus for correlation in orchestration languages, Axiomatisation and decidability of multi-dimensional Duration Calculus, On subexponentials, focusing and modalities in concurrent systems, Space-aware ambients and processes, A static analysis for brane calculi providing global occurrence counting information, Fair ambients, Using bigraphs to model topological graphs embedded in orientable surfaces, An efficient abstract machine for safe ambients, Automata and processes on multisets of communicating objects, Strategy based semantics for mobility with time and access permissions, A pure labeled transition semantics for the applied pi calculus, Combined model checking for temporal, probabilistic, and real-time logics, Theory of interaction, A decentralised graphical implementation of mobile ambients, Processes in space, Reachability problems in BioAmbients, Typed context awareness ambient calculus for pervasive applications, A model checking-based approach for security policy verification of mobile systems, Timed mobility in process algebra and Petri nets, A semantic theory of the Internet of things, Ambient abstract state machines with applications, Replacement freeness: a criterion for separating process calculi, Towards a unified approach to encodability and separation results for process calculi, Deriving structural labelled transitions for mobile ambients, The \texttt{link}-calculus for open multiparty interactions, Distributability of mobile ambients, A timed calculus for wireless systems, Characterizing contextual equivalence in calculi with passivation, Spatial calculus of looping sequences, The logic of message-passing, Access control in mobile ambient calculi: a comparative view, Role-based access control for boxed ambients, A taxonomy of process calculi for distribution and mobility, Using bisimulation proof techniques for the analysis of distributed abstract machines, Reachability analysis of fragments of mobile ambients in AC term rewriting, On the concurrent computational content of intermediate logics, A monotone framework for CCS, Pathway analysis for BioAmbients, Bitonal membrane systems: interactions of biological membranes, A simple calculus for proteins and cells, On the expressiveness of interaction, An operational semantics for a calculus for wireless systems, Hybrid logical analyses of the ambient calculus, A process calculus for mobile ad hoc networks, On the computational strength of pure ambient calculi, A semantics for behavior trees using CSP with specification commands, Decidability and complexity of Petri nets with unordered data, A coordination approach to mobile components, When ambients cannot be opened, A principled exploration of coordination models, A control flow analysis for Beta-binders with and without static compartments, Multiset rewriting for the verification of depth-bounded processes with name binding, The calculus of context-aware ambients, Event based choreography, A brief history of process algebra, Abstract interpretation based verification of temporal properties for BioAmbients, Synthesising CCS bisimulation using graph rewriting, Comparing communication primitives via their relative expressive power, A formal approach to the engineering of domain-specific distributed systems, A probabilistic calculus of cyber-physical systems, On primitives for compensation handling as adaptable processes, A process algebraic approach to reaction systems, Bialgebraic foundations for the operational semantics of string diagrams, A thesis for interaction, Flow-sensitive type systems and the ambient calculus, Dynamic management of capabilities in a network aware coordination language, LMNtal as a hierarchical logic programming language, Continuation-based transformations for coordination languages, On modelling mobility, Types for access control, Dynamic structural operational semantics, Computing with membranes, Names of the \(\pi\)-calculus agents handled locally, Static analysis for the \(\pi\)-calculus with applications to security, Resource access control in systems of mobile agents, A performance-based methodology to early evaluate the effectiveness of mobile software architectures, Models and emerging trends of concurrent constraint programming, Executable rewriting logic semantics of Orc and formal analysis of Orc programs, Dynamic connectors for concurrency, Typing evolving ambients, Hierarchical graph transformation
Cites Work
