Modelling Calculi with Name Mobility using Graphs with Equivalences

DOI10.1016/J.ENTCS.2006.10.028zbMath1278.68211OpenAlexW1977202104MaRDI QIDQ2867900

Paolo Baldan, Ugo Montanari, Fabio Gadducci

Publication date: 20 December 2013

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.10.028

zbMATH Keywords

concurrent graph rewriting\textsc{dpo} approachgraph process semanticsgraphical encoding of nominal calculi

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (2)

Ugo Montanari and Graph Transformation ⋮ Ugo Montanari and Concurrency Theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus of mobile processes. II
• Mobile ambients
• Parallelism and concurrency in high-level replacement systems
• Handbook of Graph Grammars and Computing by Graph Transformation
• 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).
• Adhesive and quasiadhesive categories
• Formal Methods in Software and Systems Modeling
• Concurrent Rewriting for Graphs with Equivalences
• Programming Languages and Systems

This page was built for publication: Modelling Calculi with Name Mobility using Graphs with Equivalences