Synthesising CCS bisimulation using graph rewriting

DOI10.1016/J.IC.2008.10.005zbMath1169.68030OpenAlexW1976563762MaRDI QIDQ1004288

Fabio Gadducci, Barbara König, Filippo Bonchi

Publication date: 2 March 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.10.005

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (6)

String diagram rewrite theory II: Rewriting with symmetric monoidal structure ⋮ String Diagram Rewrite Theory I: Rewriting with Frobenius Structure ⋮ A General Theory of Barbs, Contexts, and Labels ⋮ A decentralised graphical implementation of mobile ambients ⋮ Confluence of Graph Rewriting with Interfaces ⋮ String diagram rewrite theory III: Confluence with and without Frobenius

Cites Work

• The chemical abstract machine
• Multisets and structural congruence of the pi-calculus with replication
• Mobile ambients
• An algebraic presentation of term graphs, via gs-monoidal categories
• Pure bigraphs: structure and dynamics
• Fundamentals of algebraic graph transformation
• Explicit fusions
• Bigraphs and transitions
• Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
• Behavioral theory for mobile ambients
• Reactive Systems over Directed Bigraphs
• Deriving Structural Labelled Transitions for Mobile Ambients
• Composition and Decomposition of DPO Transformations with Borrowed Context
• Process Bisimulation Via a Graphical Encoding
• 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).
• Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
• Graph Transformations
• Foundations of Software Science and Computation Structures
• Adhesive and quasiadhesive categories
• Formal Methods in Software and Systems Modeling
• Programming Languages and Systems
• From rewrite rules to bisimulation congruences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synthesising CCS bisimulation using graph rewriting