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

DOI10.1016/S1571-0661(04)80957-5zbMath1260.68094MaRDI QIDQ4917051

Fabio Gadducci, Ugo Montanari

Publication date: 26 April 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

reduction semanticsmobile ambientsconcurrent graph rewritinggraphical encoding of process calculi

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

Adhesive and quasiadhesive categories ⋮ A decentralised graphical implementation of mobile ambients ⋮ Ugo Montanari and Graph Transformation ⋮ A Decentralized Implementation of Mobile Ambients ⋮ GETGRATS ⋮ Categorical rewriting of term-like structures ⋮ Synthesising CCS bisimulation using graph rewriting ⋮ Modelling Calculi with Name Mobility using Graphs with Equivalences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The chemical abstract machine
• A calculus of mobile processes. II
• Mathematical foundations of programming semantics. Proceedings of the 11th conference (MFPS), Tulane Univ., New Orleans, LA, USA, March 29 - April 1, 1995
• Mobile ambients
• Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
• Normal forms for algebras of connections.
• Bisimulation from open maps
• An algebraic presentation of term graphs, via gs-monoidal categories
• The non-sequential behaviour of Petri nets
• Traced monoidal categories
• Rewriting on cyclic structures: Equivalence between the operational and the categorical description
• Controlling interference in ambients

This page was built for publication: 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