Double-pullback transitions and coalgebraic loose semantics for graph transformation systems

DOI10.1023/A:1008734426504zbMath0970.68116OpenAlexW1544082280MaRDI QIDQ5929740

Hartmut Ehrig, Andrea Corradini, Reiko Heckel, U. E. Wolter

Publication date: 16 April 2001

Published in: Applied Categorical Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008734426504

zbMATH Keywords

double-pullback transitionssemantics of graph transformation systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical semantics of formal languages (18C50)

Related Items (8)

An Institution for Graph Transformation ⋮ Structural and behavioural compatibility of graphical service specifications ⋮ High-Level Programs and Program Conditions ⋮ The PBPO graph transformation approach ⋮ GETGRATS ⋮ Finitary -adhesive categories ⋮ Partial pullback complement rewriting along admissible matches ⋮ Partial pullback complement rewriting

This page was built for publication: Double-pullback transitions and coalgebraic loose semantics for graph transformation systems