Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts

DOI10.1017/S096012950600569XzbMath1107.68055OpenAlexW2101618054MaRDI QIDQ3419789

Hartmut Ehrig, Barbara König

Publication date: 7 February 2007

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096012950600569x

zbMATH Keywords

labelled transitions

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 (17)

A General Theory of Barbs, Contexts, and Labels ⋮ Recognizable languages of arrows and cospans ⋮ A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java ⋮ A decentralised graphical implementation of mobile ambients ⋮ A Decentralized Implementation of Mobile Ambients ⋮ Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts ⋮ On Symbolic Semantics for Name-decorated Contexts ⋮ Towards Secrecy for Rewriting in Weakly Adhesive Categories ⋮ A Note on an Old-Fashioned Algebra for (Disconnected) Graphs ⋮ Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding) ⋮ RPO semantics for mobile ambients ⋮ A structural approach to graph transformation based on symmetric Petri nets ⋮ Reactive Systems, Barbed Semantics, and the Mobile Ambients ⋮ Synthesising CCS bisimulation using graph rewriting ⋮ RPO, Second-Order Contexts, and λ-Calculus ⋮ Deriving Bisimulation Congruences in the Presence of Negative Application Conditions ⋮ Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs

This page was built for publication: Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts