Synthesising CCS bisimulation using graph rewriting

DOI10.1016/J.IC.2008.10.005zbMATH Open1169.68030OpenAlexW1976563762MaRDI QIDQ1004288FDOQ1004288

Authors: Filippo Bonchi, Fabio Gadducci, Barbara König 

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

Recommendations

• Process Bisimulation Via a Graphical Encoding
• Labelled transitions for mobile ambients (as synthesized via a graphical encoding)
• RPO semantics for mobile ambients
• Processes, Terms and Cycles: Steps on the Road to Infinity
• scientific article; zbMATH DE number 7020157

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (12)

• A General Theory of Barbs, Contexts, and Labels
• \textsc{WiCcA}: LTS generation tool for wire calculus
• Labelled transitions for mobile ambients (as synthesized via a graphical encoding)
• Title not available (Why is that?)
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Confluence of graph rewriting with interfaces
• Bisimulations on Data Graphs
• A decentralised graphical implementation of mobile ambients
• String diagram rewrite theory. I: Rewriting with Frobenius structure
• String diagram rewrite theory II: Rewriting with symmetric monoidal structure
• RPO semantics for mobile ambients
• String diagram rewrite theory III: Confluence with and without Frobenius

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004288)